In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
From MaRDI portal
Publication:5233101
DOI10.1137/18M1225677zbMath1421.90109arXiv1811.02879OpenAlexW2970289859MaRDI QIDQ5233101
Victor Magron, Jean-Bernard Lasserre
Publication date: 16 September 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.02879
Related Items
Positivity certificates and polynomial optimization on non-compact semialgebraic sets, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, Conic programming: infeasibility certificates and projective geometry, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- On general minimax theorems
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Global Optimization with Polynomials and the Problem of Moments
- Optimization of Polynomials in Non-Commuting Variables
- Exact Algorithms for Linear Matrix Inequalities
- Bad Semidefinite Programs: They All Look the Same
- Robust Solutions to Uncertain Semidefinite Programs
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- R <scp>eal</scp> c <scp>ertify</scp>
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- On Exact Polya and Putinar's Representations
- A paradox in bosonic energy computations via semidefinite programming relaxations
- A Sum of Squares Approximation of Nonnegative Polynomials
- Strong duality in lasserre's hierarchy for polynomial optimization
