Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization

Mathematical Programming, Series B

Volumn 89, Issue 1, 2000, Pages 89-111

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

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Global optimization; Interior point method; Nonconvex quadratic optimization problem semidefmite programming linear matrix inequality; SDP relaxation; Semi infinite LP relaxation

Indexed keywords

EID: 31844438920     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070000182     Document Type: Article

References (25)

1. Alizadeh, F. (1995): Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13-51
2. Balas, E., Ceria, S., Cornuéjols, G. (1993): A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-323
3. Balas, E., Pulleyblank, W.R. (1983): The perfect matching subgraph polytopes of a bipartite graph. Networks 13, 495-516
4. Boyd, S., Ghaoui, L.E., Feron, E., Balakrishnan, V. (1994): Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia, PA
5. Cottle, R.W., Pang, J.-S., Stone, R.E. (1992): The Linear Complementarity Problem. Academic Press, New York, NY
6. Fujie, T., Kojima, M. (1997): Semidefinite relaxation for nonconvex programs. J. Global Optim. 10, 367-380
7. Goemans, M.X. (1997): Semidefinite programming in combinatorial optimization. Math. Program. 79, 143-161
8. Goemans, M.X., Williamson, D.P. (1995): Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42, 1115-1145
9. Grötschel, M., Lovász, L., Schrijver, A. (1988): Geometric algorithms and combinatorial optimization. Springer, New York, NY
10. Kojima, M., Tunçel, L. (2000): Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optim. 10, 750-778
11. Lovász, L., Schrijver, A. (1991): Cones of matrices and set functions and 0-1 optimization. SIAM J. Optim. 1, 166-190
12. Horst, R., Tuy, H. (1992): Global Optimization. 2nd, rev. edn., Springer-Verlag, Berlin
13. Mesbahi, M., Papavassilopoulos, G.P. (1997): A cone programming approach to the bilinear matrix inequality problem and its geometry. Math. Program. 77, 247-272
14. Nesterov, Yu. E. (1998): Semidefinite relaxation and nonconvex quadratic optimization. Optim. Meth. Software 9, 141-160
15. Poljak, S., Rendl, F., Wolkowicz, H. (1995): A recipe for Semidefinite relaxation for (0,1)-quadratic programming. J. Global Optim. 7, 51-73
16. Ramana, M.V. (1993): An algorithmic analysis of multiquadratic and Semidefinite programming problems. PhD thesis, Johns Hopkins University, Baltimore, MD
17. Safonov, M.G., Goh, K.G., Ly, J.H. (1994): Control system synthesis via bilinear matrix inequalities. In: Peshkin, M, ed., Proceedings of the 1994 American Control Conference, Baltimore, MD
18. Sherali, H.D., Adams, W.P. (1990): A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411-430
19. Sherali, H.D., Adams, W.P. (1994): A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52, 83-106
20. Sherali, H.D., Tuncbilek, C.H. (1992): A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2, 101-112
21. Sherali, H.D., Tuncbilek, C.H. (1995): A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. 7, 1-31
22. Shor, N.Z. (1990): Dual quadratic estimates in polynomial and boolean programming. Ann. Oper. Res. 25, 163-168
23. Takeda, A., Dai, Y., Fukuda, M., Kojima, M. (2000): Towards implementations of successive convex relaxation methods for nonconvex quadratic optimization problems. In: Pardalos, P.M., ed., Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Kluwer Academic Publishers, Dordrecht, pp. 489-510
24. Vandenberghe, L., Boyd, S. (1996): Semidefinite programming. SIAM Rev. 38, 49-95
25. Ye, Y. (1999): Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84, 219-226