On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

DOI10.1007/11496915_10zbMath1119.90032OpenAlexW1852767571MaRDI QIDQ3596347

Anthony Man-Cho So, Yinyu Ye, Jia-Wei Zhang

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496915_10

Mathematics Subject Classification ID

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

Related Items (1)

Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems

This page was built for publication: On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations