BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Daniel Bienstock (Columbia University)
DTSTART:20210524T153000Z
DTEND:20210524T160000Z
DTSTAMP:20260417T110556Z
UID:MIP2021/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MIP2021/2/">
 Progress on polynomial optimization</a>\nby Daniel Bienstock (Columbia Uni
 versity) as part of Mixed Integer Programming Workshop 2021\n\n\nAbstract\
 nIn this talk I will describe ongoing work on polynomial optimization prob
 lems (POPs)\, from a discrete optimization perspective\, that is to say\, 
 using techniques motivated by mixed-integer programming.  In particular I 
 will primarily focus on methods for producing solutions\, and on the feasi
 bility of such solutions.  The current "king of the hill" for computing so
 lutions to POPs are filter methods relying on logarithmic barrier algorith
 ms\, implemented in codes such as IPOPT or KNITRO.  Instead we will focus 
 on techniques based on integer programming -- such techniques are not yet 
 competitive with the solvers just mentioned\, but may soon yield competiti
 ve algorithms.  \n\nIf time permits\, I will also describe joint work (wit
 h Chen Chen and Gonzalo Munoz) on techniques for obtaining lower bounds fo
 r POPs based on classical cutting-plane techniques\, such as intersection 
 cuts.\n
LOCATION:https://researchseminars.org/talk/MIP2021/2/
END:VEVENT
END:VCALENDAR