About

Recent advances in optimization, such as the development of fast iterative methods based on gradient descent, have enabled many breakthroughs in algorithm design. This workshop focuses on these recent advances in optimization and their implications for algorithm design. The workshop will explore both advances and open problems in the specific area of optimization as well as improvements in other areas of algorithm design that have leveraged optimization results as a key routine. 

Specific topics to cover include gradient descent methods for convex and non-convex optimization problems; algorithms for solving structured linear systems; algorithms for graph problems such as maximum flows and cuts, connectivity, and graph sparsification; submodular optimization.

Chairs/Organizers
Suvrit Sra (Laboratory for Information and Decision Systems, MIT)
Register

Registration is required to attend this workshop in person. Space may be limited, and you are advised to register early. To submit your name for consideration, please register and await confirmation of your acceptance before booking your travel. 

For additional information please visit: https://simons.berkeley.edu/participating-workshop.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

Register Now