On zero duality gap in nonconvex quadratic programming problems

Journal of Global Optimization

Volumn 52, Issue 2, 2012, Pages 229-242

  Zheng, X J ^a   Sun, X L ^a   Li, D ^b   Xu, Y F ^a  

^a FUDAN UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Cell enumeration; Duality gap; Lagrangian dual; Nonconvex quadratic program; SDP relaxation; Sufficient conditions

Indexed keywords

CELL ENUMERATION; DUALITY GAP; LAGRANGIAN DUAL; NONCONVEX QUADRATIC PROGRAMS; SDP RELAXATION; SUFFICIENT CONDITIONS;

CONSTRAINED OPTIMIZATION;

QUADRATIC PROGRAMMING;

EID: 84858861152     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-011-9660-y     Document Type: Conference Paper

References (41)

1. D. Avis K. Fukuda 1996 Reverse search for enumeration Discrete Appl. Math. 65 21 46 10.1016/0166-218X(95)00026-N (Pubitemid 126386259)
2. A. Beck Y.C. Eldar 2006 Strong duality in nonconvex quadratic optimization with two quadratic constraints SIAM J. Optim. 17 844 860 10.1137/050644471 (Pubitemid 47265175)
3. A. Beck M. Teboulle 2000 Global optimality conditions for quadratic optimization problems with binary constraints SIAM J. Optim. 11 179 188 10.1137/S1052623498336930 (Pubitemid 33235759)
4. Ben-Tal, A.: Conic and robust optimization. Lecture notes. Universita di Roma La Sapienzia, Rome, Italy (2002). Available at: http://ie.technion.ac.il/ Home/Users/morbt/rom.pdf
5. A. Ben-Tal M. Teboulle 1996 Hidden convexity in some nonconvex quadratically constrained quadratic programming Math. Program. 72 51 63 (Pubitemid 126372927)
6. P. Carraresi F. Farinaccio F. Malucelli 1999 Testing optimality for quadratic 0-1 problems Math. Program. 85 407 421 10.1007/s101070050064
7. Chaovalitwongse W., Androulakis I.P., Pardalos P.M.: Quadratic integer programming: complexity and equivalent forms. In: Floudas, C.A., Pardalos, P.M (eds) Encyclopedia of Optimization, pp. 3153-3159. Springer, New York (2009)
8. W. Chaovalitwongse P.M. Pardalos O.A. Prokopyev 2004 A new linearization technique for multi-quadratic 0-1 programming problems Oper. Res. Lett. 32 517 522 10.1016/j.orl.2004.03.005
9. De Angelis P.L., Toraldo G.: Quadratic programming with bound constraints. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 3161-3166. Springer, New York (2009)
10. Edelsbrunner H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)
11. S.C. Fang D.Y. Gao R.L. Sheu S.Y. Wu 2008 Canonical dual approach to solve 0-1 quadratic programming problems J. Ind. Manage. Optim. 4 125 142 10.3934/jimo.2008.4.125
12. A.L. Fradkov V.A. Yakubovich 1973 The S-procedure and the duality relation in convex quadratic programming problems Vestnik Leningrad Univ. 1 81 87
13. T. Fujie M. Kojima 1997 Semidefinite programming relaxation for nonconvex quadratic programs J. Glob. Optim. 10 367 380 10.1023/A:1008282830093 (Pubitemid 127502196)
14. D.Y. Gao N. Ruan H.D. Sherali 2009 Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality J. Glob. Optim. 45 473 497 10.1007/s10898-009- 9399-x
15. J.B. Hiriart-Urruty 1998 Conditions for global optimality 2 J. Glob. Optim. 13 349 367 10.1023/A:1008365206132
16. J.B. Hiriart-Urruty 2001 Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints J. Glob. Optim. 21 443 453 10.1023/A:1012752110010
17. V. Jeyakumar A.M. Rubinov Z.Y. Wu 2006 Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints J. Glob. Optim. 36 471 481 10.1007/s10898-006-9022-3 (Pubitemid 44326975)
18. V. Jeyakumar A.M. Rubinov Z.Y. Wu 2007 Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions Math. Program. 110 521 541 10.1007/s10107-006-0012-5 (Pubitemid 46862319)
19. 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
20. J.J. More 1993 Generalizations of the trust region problem Optim. Methods Softw. 2 189 209 10.1080/10556789308805542
21. Nesterov, Y., Nemirovski, A.: Interior-point polynomial algorithms in convex programming. Society for Industrial & Applied (1994)
22. P.M. Pardalos W. Chaovalitwongse L.D. Iasemidis J. Chris Sackellares D.S. Shiau P.R. Carney O.A. Prokopyev V.A. Yatsenko 2004 Seizure warning algorithm based on optimization and nonlinear dynamics Math. Program. 101 365 385 10.1007/s10107-004-0529-4
23. 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)
24. Pardalos, P.M., Resende, M. (eds): Handbook of Applied Optimization. Oxford University Press, New York (2002)
25. P.M. Pardalos S.A. Vavasis 1991 Quadratic programming with one negative eigenvalue is NP-hard J. Glob. Optim. 1 15 22 10.1007/BF00120662
26. M.Ç. Pinar 2004 Sufficient global optimality conditions for bivalent quadratic optimization J. Optim. Theory Appl. 122 433 440 10.1023/B:JOTA.0000042530.24671.80 (Pubitemid 39319622)
27. Pitsoulis L.: Quadratic programming with bound constraints. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 3170-3171. Springer, New York (2009)
28. I. Polik T. Terlaky 2007 A survey of the S-lemma SIAM Rev. 49 371 418 10.1137/S003614450444614X (Pubitemid 47377690)
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. J.P. Ruiz I.E. Grossmann 2011 Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks Optim. Lett. 5 1 11 10.1007/s11590-010-0228-4
31. N. Sleumer 1999 Output-sensitive cell enumeration in hyperplane arrangements Nordic J. Comput. 6 137 161
32. R.J. Stern H. Wolkowicz 1995 Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations SIAM J. Optim. 5 286 313 10.1137/0805016
33. L. Vandenberghe S. Boyd 1996 Semidefinite programming SIAM Rev. 38 49 95 10.1137/1038003 (Pubitemid 126610912)
34. Z.B. Wang S.C. Fang D.Y. Gao W.X. Xing 2008 Global extremal conditions for multi-integer quadratic programming J. Ind. Manage. Optim. 4 213 225 10.3934/jimo.2008.4.213
35. Z.Y. Wu F. Bai 2009 Global optimality conditions for mixed nonconvex quadratic programs Optimization 58 39 47 10.1080/02331930701761243
36. Z.Y. Wu V. Jeyakumar A.M. Rubinov 2007 Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints J. Optim. Theory Appl. 133 123 130 10.1007/s10957-007-9177-1
37. Yajima Y.: Quadratic knapsack. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 3159-3161. Springer, New York (2009)
38. Ye Y.: Quadratic programming over an ellipsoid. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 3166-3170. Springer, New York (2009)
39. Y. Ye S. Zhang 2003 New results on quadratic minimization SIAM J. Optim. 14 245 267 10.1137/S105262340139001X (Pubitemid 38318152)
40. T. Zaslavsky 1975 Facing up to arrangements: face-count formulas for partitions of space by hyperplanes Mem. Am. Math. Soc. 1 1 101
41. S. Zhang 2000 Quadratic maximization and semidefinite relaxation Math. Program. 87 453 465 10.1007/s101070050006