On approximating complex quadratic optimization problems via semidefinite programming relaxations
- 13 December 2006
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 110 (1), 93-110
- https://doi.org/10.1007/s10107-006-0064-6
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Quadratic forms on graphsPublished by Association for Computing Machinery (ACM) ,2005
- Maximizing Quadratic Programs: Extending Grothendieck's InequalityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Approximating the cut-norm via Grothendieck's inequalityPublished by Association for Computing Machinery (ACM) ,2004
- Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programmingJournal of Computer and System Sciences, 2003
- Extended Matrix Cube Theorems with Applications to μ-Theory in ControlMathematics of Operations Research, 2003
- Combinatorial OptimizationPublished by Springer Science and Business Media LLC ,2000
- On maximization of quadratic form over intersection of ellipsoids with common centerMathematical Programming, 1999
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- A proof of the Grothendieck inequalityIsrael Journal of Mathematics, 1974