Complex quadratic optimization and semidefinite programming

SIAM Journal on Optimization

Volumn 16, Issue 3, 2006, Pages 871-890

  Zhang, Shuzhong ^a   Huang, Yongwei ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation ratio; Complex semidefmite programming relaxation; Hermitian quadratic functions; Randomized algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATRIX ALGEBRA; OPTIMIZATION; PROBABILITY; VECTORS;

APPROXIMATION RATIO; COMPLEX SEMIDEFMITE PROGRAMMING RELAXATION; HERMITIAN QUADRATIC FUNCTIONS; RANDOMIZED ALGORITHMS;

MATHEMATICAL PROGRAMMING;

EID: 33747159547     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/04061341X     Document Type: Article

References (15)

1. I. G. ABRAHAMSON, Orthant probability for the quadrivariate normal distribution, Ann. Math. Statist., 35 (1964), pp. 1685-1703.
2. H. H. ANDERSEN, M. HØJBJERRE, D. SØRENSEN, AND P. S. ERIKSEN, Linear and Graphical Models for the Multivariate Complex Normal Distribution, Lecture Notes in Statist. 101, Springer-Verlag, New York, 1995.
3. A. BEN-TAL, A. NEMIROVSKI, AND C. ROOS, Extended matrix cube theorems with applications to μ-theory in control, Math. Oper. Res., 28 (2003), pp. 497-523.
4. D. BERTSIMAS AND Y. YE, Semidefinite relaxations, multivarite normal distribution, and order statistics, in Handbook of Combinatorial Optimization, Vol. 3, D. Z. Du and P. M. Pardalos, eds., Kluwer Academic Publishers, Boston, 1998, pp. 1-19.
5. M. CHARIKAR AND A. WIRTH, Maximizing quadratic programs: Extending Grothendieck's inequality, in Proceedings of the 45th Annual FOCS, 2004.
6. A. FRIEZE AND M. JERRUM, Improved approximation algorithms for MAX-k-CUT and Max BISECTION, Algorithmica, 18 (1997), pp. 67-81.
7. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
8. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
9. M. X. GOEMANS AND D. P. WILLIAMSON, Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming, J. Comput. System Sci., 68 (2004), pp. 442-470.
10. Z. Q. LUO, X. D. LUO, AND M. KISIALIOU, An efficient quasi-maximum likelihood decoder for PSK signals, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '03), Vol. 6, 2003, pp. 561-564.
11. YU. NESTEROV, Semidefinite relaxation and nonconvex quadratic optimization, Optim. Methods Softw., 9 (1998), pp. 141-160.
12. A. SO, J. ZHANG, AND Y. YE, On approximating complex quadratic optimization problems via semidefinite programming relaxations, in Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 3509, M. Jünger and V. Kaibel, eds., Springer-Verlag, Berlin, 2005, pp. 125-135.
13. O. TOKER AND H. ÖZBAY, On the complexity of purely complex μ computation and related problems in multidimensional systems, IEEE Trans. Automat. Control, 43 (1998), pp. 409-414.
14. Y. YE, Approximating quadratic programming with bound and quadratic constraints, Math. Program., 84 (1999), pp. 219-226.
15. S. ZHANG, Quadratic maximization and semidefinite relaxation, Math. Program., 87 (2000), pp. 453-465.