A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
From MaRDI portal
Publication:1001199
DOI10.1007/s10589-007-9112-2zbMath1153.90545OpenAlexW2064915245MaRDI QIDQ1001199
Masakazu Muramatsu, Kojima, Masakazu
Publication date: 13 February 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9112-2
Global optimizationEuclidean Jordan algebraSymmetric coneConic programPolynomial optimization problemSemidefinite programSum of squares
Related Items
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets, Positive polynomials on fibre products, Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, Solving polynomial least squares problems via semidefinite programming relaxations, Polynomial sum of squares in fluid dynamics: a review with a look ahead, A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming, A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization, Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\), Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion, Positive polynomials on projective limits of real algebraic varieties, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, Recognizing underlying sparsity in optimization, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, Univariate parameterization for global optimization of mixed-integer polynomial problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Semidefinite programming relaxations for semialgebraic problems
- Sparsity in sums of squares of polynomials
- Global Optimization with Polynomials and the Problem of Moments
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
