On approximating complex quadratic optimization problems via semidefinite programming relaxations

Mathematical Programming

Volumn 110, Issue 1, 2007, Pages 93-110

  So, Anthony Man Cho ^a   Zhang, Jiawei ^b   Ye, Yinyu ^a  

^a Stanford University   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Complex semidefinite programming; Grothendieck's inequality; Hermitian quadratic functions

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL OPTIMIZATION; CONTROL THEORY; GENETIC ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMPLEX SEMIDEFINITE PROGRAMMING; GROTHENDIECK'S INEQUALITY; HERMITIAN QUADRATIC FUNCTIONS; QUADRATIC OPTIMIZATION PROBLEMS; SEMIDEFINITE PROGRAMMING (SDP) MODELS;

QUADRATIC PROGRAMMING;

EID: 33947142577     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0064-6     Document Type: Article

References (16)

1. Alon, N., Makarychev, K., Makarychev, Y., Naor, A.: Quadratic forms on graphs. In: Proceedings of the 37th annual ACM symposium on theory of computing, pp. 486-493 (2005)
2. Alon, N., Naor, A.: Approximating the Cut-Norm via Grothendieck's inequality. In: Proceedings of the 36th annual ACM symposium on theory of computing, pp. 72-80 (2004)
3. Ben-Tal, A., Nemirovski, A., Roos, C.: Extended matrix cube theorems with applications to μ-theory in control. Math. Oper. Res. 28(3), 497-523 (2003)
4. Charikar, M., Wirth, A.: Maximizing quadratic programs: extending Grothendieck's inequality. In: Proceedings of the 45th annual IEEE symposium on foundations of computer science, pp. 54-60 (2004)
5. Frieze, A., Jerrum, M.: Improved approximation algorithms for Max k-Cut and Max bisection. Algorithmica 18, 67-81 (1997)
6. Goemans, M.X., Rendl, F.: Combinatorial optimization. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of semidefinite programming: theory, algorithms and applications, pp. 343-360. Kluwer, Dordrecht (2000)
7. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115-1145 (1995)
8. Goemans, M.X., Williamson, D.P.: Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming. J. Comput. Syst. Sci. 68(2), 442-470 (2004)
9. Hochbaum, D.S. (ed.): Approximation algorithms for NP-hard problems. PWS Publishing Company, (1997)
10. Nemirovski, A., Roos, C., Terlaky, T.: On maximization of quadratic form over intersection of ellipsoids with common center. Math. Prog. Ser. A 86, 463-473 (1999)
11. Nesterov, Y.: Global quadratic optimization via conic relaxation, CORE Discussion Paper 9860. Université Catholique de Louvain (1998)
12. Rietz, R.E.: A proof of the Grothendieck inequality. Israel J. Math. 19, 271-276 (1974)
13. Toker, O., Özbay, H.: On the complexity of purely complex μ computation and related problems in multidimensional systems. IEEE Trans Automat Control 43(3), 409-414 (1998)
14. Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev 38(1), 49-95 (1996)
15. Ye, Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Prog. 84, 219-226 (1999)
16. Zhang, S., Huang, Y.: Complex quadratic optimization and semidefinite programming. Technical Report SEEM 2004-03, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, 2004. SIAM J. Optim. 16(3), 871-890 (2006)