Sparse polynomial optimization with matrix constraints
From MaRDI portal
Cites work
- A characterization for tightness of the sparse moment-SOS hierarchy
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- A moment-sum-of-squares hierarchy for robust polynomial matrix inequality optimization with sum-of-squares convexity
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- A note on the representation of positive polynomials with structured sparsity
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Exploiting term sparsity in noncommutative polynomial optimization
- Extremal positive semidefinite forms
- Finite convergence of the moment-SOS hierarchy for polynomial matrix optimization
- First and second order analysis of nonlinear semidefinite programs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Minimizer Extraction in Polynomial Optimization Is Robust
- Moment and Polynomial Optimization
- On the complexity of matrix Putinar's Positivstellensätz
- Polynomial matrix inequality and semidefinite representation
- Sparse noncommutative polynomial optimization
- Sparse polynomial optimization with unbounded sets
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- The hierarchy of local minimums in polynomial optimization
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
This page was built for publication: Sparse polynomial optimization with matrix constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346418)
