A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
From MaRDI portal
(Redirected from Publication:453058)
Recommendations
- On equivalence of semidefinite relaxations for quadratic matrix programming
- Quadratic Matrix Programming
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
- Semidefinite relaxation and nonconvex quadratic optimization
- New positive semidefinite relaxations for nonconvex quadratic programs
Cites work
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- A remark on the rank of positive semidefinite matrices subject to affine constraints
- An Interior-Point Method for Semidefinite Programming
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Minimizing the object dimensions in circle and sphere packing problems
- On Lagrangian relaxation of quadratic matrix constraints
- Parameter Estimation in the Presence of Bounded Data Uncertainties
- Problems of distance geometry and convex properties of quadratic maps
- Quadratic Matrix Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Semidefinite Programming
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- The trust region subproblem and semidefinite programming*
Cited in
(11)- Quadratic Matrix Programming
- New semidefinite relaxations for a class of complex quadratic programming problems
- 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
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
- On Convex Hulls of Epigraphs of QCQPs
- On equivalence of semidefinite relaxations for quadratic matrix programming
- 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)
