An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
From MaRDI portal
(Redirected from Publication:879967)
Recommendations
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Polynomial optimization problems and their relaxations
- Moments and sums of squares for polynomial optimization and related problems
- Exact conic programming relaxations for a class of convex polynomial cone programs
- Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones
Cites work
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Euclidean Jordan algebras and interior-point algorithms
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Matrix sum-of-squares relaxations for robust semi-definite programs
- On a commutative class of search directions for linear programming over symmetric cones
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Second-order cone programming
- Semidefinite programming relaxations for semialgebraic problems
- Sparsity in sums of squares of polynomials
- The truncated complex $K$-moment problem
Cited in
(25)- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Robust control of uncertain systems: classical results and recent developments
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- Sum of squares generalizations for conic sets
- Exactness of sums of squares relaxations involving \(3\times 3\) matrices and Lorentz cones
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- scientific article; zbMATH DE number 5543687 (Why is no real title available?)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
- Robust stability, ℋ2 analysis and stabilisation of discrete-time Markov jump linear systems with uncertain probability matrix
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Polynomial optimization problems and their relaxations
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
- Derivatives of eigenvalues and Jordan frames
- Perturbed sums-of-squares theorem for polynomial optimization and its applications
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Solving polynomial least squares problems via semidefinite programming relaxations
- Exact conic programming relaxations for a class of convex polynomial cone programs
This page was built for publication: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879967)
