Cones of matrices and successive convex relaxations of nonconvex sets

SIAM Journal on Optimization

Volumn 10, Issue 3, 2000, Pages 750-778

  Kojima, Masakazu ^a   Tunçel, Levent ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Bilinear matrix inequality; Global optimization; Linear matrix inequality; Nonconvex quadratic optimization problem; Semi infinite programming; Semidefinite programming

Indexed keywords

EID: 0040214558     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498336450     Document Type: Article

References (29)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. E. BALAS, S. CERIA, AND G. CORNUÉJOLS, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Math. Programming, 58 (1993), pp. 295-323.
3. S. BOYD, L. EL GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear Matrix Inequalities in System and Control Theory, Stud. Appl. Math. 15, SIAM, Philadelphia, 1994.
4. R. W. COTTLE, J. S. PANG, AND R. E. STONE, The Linear Complementarity Problem, Academic Press, New York, 1992.
5. G. EWALD, D. G. LARMAN, AND C. A. ROGERS, The directions of the line segments and of the r-dimensional balls on the boundary of a convex body in Euclidean space, Mathematika, 17 (1970), pp. 1-20.
6. T. FUJIE AND M. KOJIMA, Semidefinite relaxation for nonconvex programs, J. Global Optim., 10 (1997), pp. 367-380.
7. M. X. GOEMANS, Semidefinite programming in combinatorial optimization, Math. Programming, 79 (1997), pp. 143-161.
8. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145.
9. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer, New York, 1988.
10. M. KOJIMA AND L. TUNÇEL, Discretization and Localization in Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems, Technical Report B-341, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo, Japan, 1998. Also issued as CORR 98-34, Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, ON N2L 3G1, Canada.
11. M. KOJIMA AND A. TAKEDA, Complexity Analysis of Conceptual Successive Convex Relaxation of Nonconvex Sets, Technical Report B-350, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo, Japan, 1999.
12. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
13. R. HORST AND H. TUY, Global Optimization, 2nd rev. ed., Springer-Verlag, Berlin, 1992.
14. M. MESBAHI AND G. P. PAPAVASSILOPOULOS, A cone programming approach to the bilinear matrix inequality problem and its geometry, Math. Programming, 77 (1997), pp. 247-272.
15. YU. E. NESTEROV, Semidefinite relaxation and nonconvex quadratic optimization, Optim. Methods Softw., 9 (1998), pp. 141-160.
16. YU. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, Stud. Appl. Math. 13, SIAM, Philadelphia, 1994.
17. G. PATAKI AND L. TUNÇEL, On the Generic Properties of Convex Optimization Problems in Conic Form, Research Report 97-16, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1997, revised 1999.
18. S. POLJAK, F. RENDL, AND H. WOLKOWICZ, A recipe for semidefinite relaxation for (0,1)-quadratic programming, J. Global Optim., 7 (1995), pp. 51-73.
19. M. V. RAMANA, An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems Ph.D. Thesis, Johns Hopkins University, Baltimore, MD, 1993.
20. M. G. SAFONOV, K. G. GOH, AND J. H. LY, Control system synthesis via bilinear matrix inequalities, in Proceedings of the 1994 American Control Conference, Baltimore, MD, IEEE, 1994, pp. 45-49.
21. H. D. SHERALI AND A. ALAMEDDINE, A new reformulation-linearization technique for bilinear programming problems, J. Global Optim., 2 (1992), pp. 379-410.
22. H. D. SHERALI AND C. H. TUNCBILEK, A reformulation-convexification approach for solving nonconvex quadratic programming problems, J. Global Optim., 7 (1995), pp. 1-31.
23. N. Z. SHOR, Quadratic optimization problems, Soviet J. Comput. Systems Sci., 25 (1987), pp. 1-11.
24. N. Z. SHOR, Dual quadratic estimates in polynomial and boolean programming, Ann. Oper. Res., 25 (1990), pp. 163-168.
25. T. STEPHEN AND L. TUNÇEL, On a representation of the matching polytope via semidefinite liftings, Math. Oper. Res., 24 (1999), pp. 1-7.
26. J. STOER AND C. WITZGALL, Convexity and Optimization in Finite Dimensions I, Springer-Verlag, Berlin, 1970.
27. A. TAKEDA Y. DAI, M. FUKUDA, AND M. KOJIMA, Towards the implementation of successive convex relaxation method for nonconvex quadratic optimization problem, in Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, P. M. Pardalos, ed., Kluwer Academic Press, Dordrecht, to appear.
28. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
29. Y. YE, Approximating quadratic programming with bound and quadratic constraints, Math. Programming, 84 (1999), pp. 219-226.