EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1886. Convergence analysis of the sum-of-squares hierarchy for polynomial optimization
Invited abstract in session MC-38: Applications of polynomial optimization, stream Conic Optimization: Theory, Algorithms, and Applications.
Monday, 12:30-14:00Room: 34 (building: 306)
Authors (first author is the speaker)
| 1. | Lucas Slot
|
| ETH Zürich |
Abstract
The moment-SOS hierarchy provides a sequence of lower bounds on the minimum of a polynomial f on a semialgebraic set S. These bounds can be computed by solving semidefinite programs of increasing size, corresponding to sum-of-squares representations of increasing degree. As a consequence of powerful Positivstellensätze from real algebraic geometry, the bounds are known to converge to the true minimum of f under mild assumptions on the feasible region S. In this talk, we discuss some recent progress on the asymptotic behaviour of the SOS-hierarchy for certain special choices of S, such as the unit hypercube.
Keywords
- Programming, Semidefinite
Status: accepted
Back to the list of papers