11/3/22 | 4:15pm | E51-145

Sam Burer

Tippie-Rollins Professor of Business Analytics
University of Iowa

Abstract: Copositive optimization is a tool for modeling (and approximating) difficult nonconvex problems using convex optimization. We survey and illustrate this research area using several vignettes on diverse topics such as mixed integer nonlinear programming, robust optimization, neural networks, and quantum computing.

Bio: Sam Burer is the Tippie Rollins Professor in the Department of Business Analytics at the University of Iowa. He received his Ph.D. from the Georgia Institute of Technology, and his research focuses on convex optimization, especially semidefinite and copositive programming. He is the 2020 recipient of the INFORMS Computing Paper Prize, and his work has been supported by grants from the National Science Foundation, including the CAREER award. He currently serves as an area editor of *Operations Research* and as an associate editor for *SIAM Journal on Optimization* and *Mathematical Programming*. He also serves as Vice Chair of the SIAM Activity Group on Optimization and as Treasurer of the Mathematical Optimization Society.