On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming

DOI10.1287/moor.1100.0473zbMath1218.90149OpenAlexW2158898601MaRDI QIDQ3169131

Henry Wolkowicz, Yichuan Ding, Dong-Dong Ge

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1100.0473

zbMATH Keywords

semidefinite programming relaxationssparsity patternsquadratic constrained quadratic programmingquadratic matrix programminghard combinatorial problems

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items (9)

Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ The Maximum k-Colorable Subgraph Problem and Related Problems ⋮ A survey of hidden convex optimization ⋮ On Integrality in Semidefinite Programming for Discrete Optimization ⋮ Linear Programming on the Stiefel Manifold ⋮ An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem ⋮ The generalized trust region subproblem ⋮ Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem ⋮ SDP Relaxations for Some Combinatorial Optimization Problems

This page was built for publication: On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming