SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS

DOI10.1142/S0217595910002533zbMath1186.90085OpenAlexW2009581913MaRDI QIDQ3560105

Martin Mevissen, Kojima, Masakazu

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

quadratic optimizationsparsitypolynomial optimizationsemidefinite programming relaxation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
• Sparsity in sums of squares of polynomials
• Global Optimization with Polynomials and the Problem of Moments
• Testing Unconstrained Optimization Software
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem