SDP relaxations for quadratic optimization problems derived from polynomial optimization problems

DOI10.1142/S0217595910002533MaRDI QIDQ3560105zbMATH OpenOpenAlexFDO

Authors Martin Mevissen, Masakazu Kojima

Publication date 19 May 2010

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0217595910002533

zbMATH Keywords

polynomial optimizationquadratic optimizationsemidefinite programming relaxationsparsity

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22)

Recommendations

• EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
• An extension of the elimination method for a sparse SOS polynomial
• A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
• Exploiting sparsity in SDP relaxation of polynomial optimization problems
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

Cites work

• Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
• Global optimization with polynomials and the problem of moments
• scientific article; zbMATH DE number 44730 (Why is no real title available?)
• Sparsity in sums of squares of polynomials
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Testing Unconstrained Optimization Software
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(9)

• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
• Exploiting sparsity in SDP relaxation of polynomial optimization problems
• An extension of the elimination method for a sparse SOS polynomial
• A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
• EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
• Solving partial differential equations via sparse SDP relaxations
• Exactness criteria for SDP-relaxations of quadratic extremum problems
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs

This page was built for publication: SDP relaxations for quadratic optimization problems derived from polynomial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560105)