ISE Seminar Calendar
http://illinois.edu/calendar/list/3605
Industrial and Enterprise Systems Engineering Seminars/SpeakersISE Seminar-Recent Results on Sparse Polynomial Optimization Problems
http://illinois.edu/calendar/detail/3605/33075937
GE/IE 590 Seminarhttp://illinois.edu/calendar/detail/3605/33075937Thu, 05 May 2016 16:00:00 CDT<p><strong>Abstract</strong></p>
<p style="text-align: justify;">I will survey recent results (some ours and some not) on solving polynomial optimization problems over sparse constraints. This field incorporates ideas from integer programming, linear programming and algebraic geometry. Polynomial optimization problems over continuous variables are strongly NP-hard in the sense that we can reduce standard binary integer programs to them, in a direct way. However there is an underlying additional difficulty caused by numerics, in particular the (non) existence of rational solutions.</p>
<p><strong>Biography</strong></p>
<p style="text-align: justify;">Daniel Bienstock is Professor at the departments of Industrial Engineering and Operations Research, and Applied Physics and Applied Mathematics, Columbia University. He received the PhD in Operations Research from MIT. His current research focuses on nonconvex optimization problems and on problems arising in power engineering. He has published two books: "Electrical Transmission System Cascades and Vulnerability: An Operations Research Viewpoint", Springer (2015) and "Potential function methods for approximately solving linear programming problems, Theory and Practice", Springer, (2002). He received a Presidential Young Investigator Award, an Informs Fellow Award, an IBM Research Partnership award, and is currently editor-in-chief of Mathematical Programming Computation.</p>