How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
From MaRDI portal
Publication:1926632
DOI10.1007/s11590-011-0384-1zbMath1257.90069OpenAlexW2054413257MaRDI QIDQ1926632
Publication date: 28 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0384-1
Related Items
On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Bad Semidefinite Programs: They All Look the Same, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Numerical algebraic geometry and semidefinite programming, Weak infeasibility in second order cone programming, Conic programming: infeasibility certificates and projective geometry, Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone, Douglas-Rachford splitting and ADMM for pathological convex optimization, Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs, Perturbed sums-of-squares theorem for polynomial optimization and its applications, In SDP Relaxations, Inaccurate Solvers Do Robust Optimization, A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs, Solving SDP completely with an interior point oracle, Exact Duality in Semidefinite Programming Based on Elementary Reformulations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New stopping criteria for detecting infeasibility in conic optimization
- An independent benchmarking of SDP and SOCP solvers
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Global Optimization with Polynomials and the Problem of Moments
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- A Sum of Squares Approximation of Nonnegative Polynomials
