Nonconvex quadratically constrained quadratic programming: Best D.C. decompositions and their SDP representations

Journal of Global Optimization

Volumn 50, Issue 4, 2011, Pages 695-712

  Zheng, X J ^a   Sun, X L ^a   Li, D ^b  

^a FUDAN UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Feasible solution; Nonconvex quadratically constrained quadratic programming; Optimal D.C. decomposition; Piecewise linear approximation; Semidefinite program

Indexed keywords

D.C. DECOMPOSITION; FEASIBLE SOLUTION; NONCONVEX; PIECEWISE LINEAR APPROXIMATIONS; SEMIDEFINITE PROGRAMS;

MATRIX ALGEBRA; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; RELAXATION PROCESSES;

QUADRATIC PROGRAMMING;

EID: 80051591115     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-010-9630-9     Document Type: Article

References (38)

1. F.A. Al-Khayyal C. Larsen T. Van Voorhis 1995 A relaxation method for nonconvex quadratically constrained quadratic programs J. Global Optim. 6 215 230 10.1007/BF01099462
2. K.M. Anstreicher 2009 Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming J. Global Optim. 43 471 484 10.1007/s10898-008-9372-0
3. K.M. Anstreicher S. Burer 2005 D. C versus copositive bounds for standard QP. J. Global Optim. 33 299 312 10.1007/s10898-004-4312-0 (Pubitemid 41618777)
4. C. Audet P. Hansen B. Jaumard G. Savard 2000 A branch and cut algorithm for nonconvex quadratically constrained quadratic programming Math. Program. 87 131 152
5. Bertsekas D.P., Nedić A., Ozdaglar A.E.: Convex Analysis and Optimization. Athena Scientific Belmont, Mass (2003)
6. I.M. Bomze 2002 Branch-and-bound approaches to standard quadratic optimization problems J. Global Optim. 22 17 37 10.1023/A:1013886408463
7. I.M. Bomze M.D. Dür E. De Klerk C. Roos A.J. Quist T. Terlaky 2000 On copositive programming and standard quadratic optimization problems J. Global Optim. 18 301 320 10.1023/A:1026583532263
8. I.M. Bomze M. Locatelli 2004 Undominated DC. decompositions of quadratic functions and applications to branch-and-bound approaches Comput. Optim. Appl. 28 227 245 10.1023/B:COAP.0000026886.61324.e4
9. T. Fujie M. Kojima 1997 Semidefinite programming relaxation for nonconvex quadratic programs J. Global Optim. 10 367 380 10.1023/A:1008282830093 (Pubitemid 127502196)
10. M.X. Goemans D.P. Williamson 1995 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. ACM 42 1115 1145 10.1145/227683.227684
11. Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming (web page and software) (2009)
12. B. Kalantari J.B. Rosen 1987 An algorithm for global minimization of linearly constrained concave quadratic functions Math. Oper. Res. 12 544 561 10.1287/moor.12.3.544
13. S. Kim M. Kojima 2001 Second order cone programming relaxation of nonconvex quadratic optimization problems Optim. Methods Softw. 15 3 201 224 10.1080/10556780108805819 (Pubitemid 33817509)
14. S. Kim M. Kojima 2003 Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations Comput. Optim. Appl. 26 143 154 10.1023/A:1025794313696
15. An LeThi Hoai Tao Pham Dinh 1997 Solving a class of linearly constrained indefinite quadratic problems by D C. algorithms J. Global Optim. 11 253 285 10.1023/A:1008288411710
16. An LeThi Hoai Tao Pham Dinh Muu Le Dung 1998 A combined D C. optimization-ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems J. Comb. Optim. 2 9 28
17. J. Linderoth 2005 A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs Math. Program. 103 251 282 10.1007/s10107-005-0582-7 (Pubitemid 40878750)
18. G.P. McCormick 1976 Computability of global solutions to factorable nonconvex programs: Part IłConvex underestimating problems Math. Program. 10 147 175 10.1007/BF01580665
19. J.J. Moré D.C. Sorensen 1983 Computing a trust region step SIAM J. Sci. Stat. Comput. 4 553 572 10.1137/0904038
20. Y. Nesterov 1998 Semidefinite relaxation and nonconvex quadratic optimization Optim. Methods Softw. 9 141 160 10.1080/10556789808805690 (Pubitemid 128542194)
21. P.M. Pardalos J.H. Glick J.B. Rosen 1987 Global minimization of indefinite quadratic problems Computing 39 281 291 10.1007/BF02239972 (Pubitemid 18562735)
22. Pardalos P.M., Rosen J.B.: Constrained Global Optimization: Algorithms and Applications. Springer, Berlin (1987)
23. P.M. Pardalos S.A. Vavasis 1991 Quadratic programming with one negative eigenvalue is NP-hard J. Global Optim. 1 15 22 10.1007/BF00120662
24. A.T. Phillips J.B. Rosen 1990 Guaranteed ε-approximate solution for indefinite quadratic global minimization Naval Res. Logist. 37 499 514 10.1002/1520-6750(199008)37:4<499::AID-NAV3220370405>3.0.CO;2-9
25. S. Poljak F. Rendl H. Wolkowicz 1995 A recipe for semidefinite relaxation for (0, 1)-quadratic programming J. Global Optim. 7 51 73 10.1007/BF01100205
26. S. Poljak H. Wolkowicz 1995 Convex relaxations of (0-1) quadratic programming Math. Oper. Res. 20 550 561 10.1287/moor.20.3.550
27. U. Raber 1998 A simplicial branch-and-bound method for solving nonconvex all-quadratic programs J. Global Optim. 13 417 432 10.1023/A:1008377529330 (Pubitemid 128507402)
28. Ramana, M.: An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems. PhD thesis, The Johns Hopkins University, Baltimore (1993)
29. J.B. Rosen P.M. Pardalos 1986 Global minimization of large-scale constrained concave quadratic problems by separable programming Math. Program. 34 163 174 10.1007/BF01580581 (Pubitemid 16554432)
30. N.V. Sahinidis 1996 BARON: a general purpose global optimization software package J. Global Optim. 8 201 205 10.1007/BF00138693
31. Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Technical Report RC24695 (W0811-090), IBM, Yorktown Heights, NY (2008)
32. Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht (1999)
33. H.D. Sherali B.M.P. Fraticelli 2002 Enhancing rlt relaxations via a new class of semidefinite cuts J. Global Optim. 22 233 261 10.1023/A:1013819515732
34. N.Z. Shor 1987 Quadratic optimization problems Sov. J. Comput. Syst. Sci. 25 1 11
35. M. Tawarmalani N.V. Sahinidis 2004 Global optimization of mixed-integer nonlinear programs: A theoretical and computational study Math. Program. 99 563 591 10.1007/s10107-003-0467-6 (Pubitemid 40871718)
36. L. Vandenberghe S. Boyd 1996 Semidefinite programming SIAM Rev. 38 49 95 10.1137/1038003 (Pubitemid 126610912)
37. Y. Ye 1999 Approximating global quadratic optimization with convex quadratic constraints J. Global Optim. 15 1 17 10.1023/A:1008370723217 (Pubitemid 129617306)
38. S. Zhang 2000 Quadratic maximization and semidefinite relaxation Math. Program. 87 453 465 10.1007/s101070050006