Lea Kapelevich
PhD student at the Operations Research Center at MIT.
Session
07-24
15:45
120min
Polynomial and Moment Optimization in Julia and JuMP
Juan Pablo Vielma, Lea Kapelevich, Chris Coey, Tillmann Weisser, Benoît Legat
Polynomial and moment optimization problems are infinite dimensional optimization problems that can model a wide range of problems in engineering and statistics. In this minisymposium we show how the Julia and JuMP ecosystems are particularly well suited for the effortless construction of these problems and the development of state-of-the-art solvers for them.
Elm A