A facial reduction algorithm for finding sparse SOS representations
From MaRDI portal
Publication:613325
DOI10.1016/j.orl.2010.05.011zbMath1205.90219OpenAlexW2083546432MaRDI QIDQ613325
Hayato Waki, Masakazu Muramatsu
Publication date: 20 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.05.011
Related Items (9)
Facial reduction algorithms for conic optimization problems ⋮ Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs ⋮ Chordal graphs in triangular decomposition in top-down style ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ Perturbed sums-of-squares theorem for polynomial optimization and its applications ⋮ Smaller SDP for SOS decomposition ⋮ Facially Dual Complete (Nice) Cones and Lexicographic Tangents
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Regularizing the abstract convex program
- Extremal psd forms with few terms
- An algorithm for sums of squares of real polynomials
- Semidefinite programming relaxations for semialgebraic problems
- Sparsity in sums of squares of polynomials
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Global Optimization with Polynomials and the Problem of Moments
- Strong Duality for Semidefinite Programming
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
This page was built for publication: A facial reduction algorithm for finding sparse SOS representations
