About me.

I’m a PhD candidate in Caltech’s Department of Computing & Mathematical Sciences. I work on nonlinear convex optimization with Venkat Chandrasekaran and Adam Wierman. Since 2018, I have been fortunate to be supported by an NSF Graduate Research Fellowship. In 2016 I received my undergraduate degree from UC Berkeley in Industrial Engineering and Operations Research. I’ll be returning to Berkeley in 2021 as a postdoc working on randomized numerical linear algebra. Go Bears!

This website hosts information on my research and professional service activities. Navigate this website with the links at the top-right of each page.

Screen Shot 2020-04-21 at 10.55.19 AM

News!

  • January 2021: I’ve accepted an offer for a postdoc with Jim Demmel and Michael Mahoney. Starting in July I’ll have a dual appointment with UC Berkeley and ICSI, where I’ll be working on the randomized numerical linear algebra aspects of BALLISTIC.
  • December 20, 2020: my first journal submission in grad school, “Newton Polytopes and Relative Entropy Optimization,” has been accepted for publication in Foundations of Computational Mathematics!
  • November 9, 2020: my paper with Helen and Thorsten has been revised, and is available on arXiv under a new title “Sublinear Circuits and the Constrained Signomial Nonnegativity Problem.” This revision is more accessible, addresses insights for computational optimization, and improves one result.
  • August 19, 2020: I gave a remote presentation on “The X-circuits Behind Conditional SAGE Certificates” to the De Loera Group  at UC Davis. Refer to my research page for slides.
  • August 11, 2020: my paper which introduced conditional SAGE certificates has been accepted to the  journal Mathematical Programming Computation.
  • June 15, 2020: Helen Naumann, Thorsten Theobald, and I have finished our paper “The X-circuits Behind Conditional SAGE Certificates.”
  • April 17, 2020: I gave a recorded talk on signomial optimization and “conditional SAGE relaxations” through MIT’s Virtual Seminar on Optimization and Related Areas. See the website’s research tab for more information.
  • December 2019: After two years of steady contributions, I’ve joined as the third member of CVXPY‘s core development team.
  • November 2019: my Facebook internship work on robust market equilibrium was accepted to AAAI 2020. Oral presentation given by coauthor Christian Kroer.
  • September – October 2019: I worked at the Max Planck Institute for Mathematics in the Sciences (MPI MiS) in Leipzig, Germany, as a visiting researcher in Bernd Sturmfels’ nonlinear algebra group.
  • August 2019: I organized ICCOPT sessions on sparse polynomial optimization (presentations by Venkat Chandrasekaran, Jie Wang, and Henning Seidler), and signomial optimization and log-log convexity (presentations by Berk Orztuk, myself, and Akshay Agarwal).
  • June 2019: as part of the SIAM Conference on Applied Algebraic Geometry, I presented my work on “conditional SAGE certificates” for signomial and polynomial nonnegativity.
  • May 2019: I gave a recorded talk on SAGE signomials and polynomials at the Banff International Research Station in Canada.
  • June – September 2019: I interned at Facebook’s division of Core Data Science, under the supervision of Parikshit Shah.

Riley Murray on ResearchGate

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.