An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones

DOI10.1007/S10107-006-0004-5zbMath1210.90159OpenAlexW1998648277MaRDI QIDQ879967

Masakazu Muramatsu, Kojima, Masakazu

Publication date: 10 May 2007

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0004-5

zbMATH Keywords

global optimizationsymmetric conepolynomial optimizationsum of squaresEuclidean Jordan algebraconic programsemidefinite program

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30)

Related Items (16)

Derivatives of eigenvalues and Jordan frames ⋮ Solving polynomial least squares problems via semidefinite programming relaxations ⋮ Robust stability, ℋ₂ analysis and stabilisation of discrete-time Markov jump linear systems with uncertain probability matrix ⋮ Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras ⋮ Sum of squares generalizations for conic sets ⋮ A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming ⋮ 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 convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems ⋮ Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems ⋮ Exact conic programming relaxations for a class of convex polynomial cone programs ⋮ Matrix sum-of-squares relaxations for robust semi-definite programs ⋮ Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion ⋮ A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones ⋮ Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems ⋮ Perturbed sums-of-squares theorem for polynomial optimization and its applications

Uses Software

• SeDuMi
• GloptiPoly
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• Second-order cone programming
• Semidefinite programming relaxations for semialgebraic problems
• On a commutative class of search directions for linear programming over symmetric cones
• Sparsity in sums of squares of polynomials
• Matrix sum-of-squares relaxations for robust semi-definite programs
• Global Optimization with Polynomials and the Problem of Moments
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
• The truncated complex $K$-moment problem
• Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
• Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
• GloptiPoly

This page was built for publication: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones