A new semidefinite programming relaxation scheme for a class of quadratic matrix problems

DOI10.1016/J.ORL.2012.03.005zbMath1247.90210OpenAlexW2099957749MaRDI QIDQ453058

Yoel Drori, Amir Beck, Marc Teboulle

Publication date: 18 September 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.03.005

zbMATH Keywords

homogenizationstrong dualitysemidefinite relaxationsrank reductionnonconvex quadratic optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (4)

On Convex Hulls of Epigraphs of QCQPs ⋮ On the tightness of SDP relaxations of QCQPs ⋮ A survey of hidden convex optimization ⋮ Efficient first-order methods for convex minimization: a constructive approach

Cites Work

• Unnamed Item
• Unnamed Item
• Problems of distance geometry and convex properties of quadratic maps
• A remark on the rank of positive semidefinite matrices subject to affine constraints
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
• Strong duality for a trust-region type relaxation of the quadratic assignment problem
• Minimizing the object dimensions in circle and sphere packing problems
• On Lagrangian Relaxation of Quadratic Matrix Constraints
• Lectures on Modern Convex Optimization
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Parameter Estimation in the Presence of Bounded Data Uncertainties
• The trust region subproblem and semidefinite programming*
• Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• Quadratic Matrix Programming
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

This page was built for publication: A new semidefinite programming relaxation scheme for a class of quadratic matrix problems