A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
From MaRDI portal
Publication:453058
DOI10.1016/J.ORL.2012.03.005zbMATH Open1247.90210OpenAlexW2099957749MaRDI QIDQ453058FDOQ453058
Amir Beck, Yoel Drori, 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
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Semidefinite Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- An Interior-Point Method for Semidefinite Programming
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Problems of distance geometry and convex properties of quadratic maps
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Minimizing the object dimensions in circle and sphere packing problems
- Parameter Estimation in the Presence of Bounded Data Uncertainties
- The trust region subproblem and semidefinite programming*
- Quadratic Matrix Programming
- A remark on the rank of positive semidefinite matrices subject to affine constraints
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- On Lagrangian relaxation of quadratic matrix constraints
Cited In (7)
- On the tightness of SDP relaxations of QCQPs
- A survey of hidden convex optimization
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Efficient first-order methods for convex minimization: a constructive approach
- On Convex Hulls of Epigraphs of QCQPs
- Accelerated first-order methods for a class of semidefinite programs
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
This page was built for publication: A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453058)
