A polyhedral study of nonconvex quadratic programs with box constraints

Mathematical Programming

Volumn 102, Issue 3, 2005, Pages 531-557

  Vandenbussche, Dieter ^a   Nemhauser, George L ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; SET THEORY;

COMPLEMENTARY CONSTRAINTS; NONCONVEX QUADRATIC PROGRAMS; OPTIMALITY CONDITIONS; QUADRATIC PROGRAM WITH BOUNDS (QPB);

QUADRATIC PROGRAMMING;

EID: 17444372087     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0549-0     Document Type: Article

References (15)

1. An, L.T.H., Tao, P.D.: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Glob. Optim. 13, 171-206 (1998)
2. Balas, E.: Nonconvex quadratic programming via generalized polars. SIAM J. Appl. Math. 28, 335-349 (1975)
3. Crowder, H., Johnson, E.L., Padberg, M.W.: Solving large scale zero-one integer programming problems. Oper. Res. 31, 803-834 (1983)
4. Dang, C., Xu, L.: A barrier function method for the nonconvex quadratic programming problem with box constraints. J. Glob. Optim. 18, 165-188 (2000)
5. De Angelis, P., Pardalos, P., Toraldo, G.: Quadratic programming with box constraints. In: I.M. Bomze, T. Csendes, R. Horst, P. Pardalos (eds.), Developments in Global Optimization, Kluwer Academic Publishers, 1997, pp. 73-94
6. de Farias, Jr., I.R., Johnson, G.L.: Nemhauser. Facets of the complementarity knapsack polytope. Math. Oper. Res. 27, 210-226 (2002)
7. de Farias, Jr., I.R., Nemhauser, G.L.: A polyhedral study of the cardinality constrained knapsack polytope. Math. Prog. 96, 439-467 (2003)
8. Gupta, S., Pardalos, P.M.: A note on a quadratic formulation for linear complementarity problems. J. Optim. Theory Appl. 57, 197-202 (1988)
9. Hansen, P., Jaumard, B., Ruiz, M., Xiong, J.: Global minimization of indefinite quadratic functions subject to box constraints. Nav. Res. Logist. 40, 373-392 (1993)
10. Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45, 139-172 (1989)
11. Rosenberg, LG.: 0-1 optimization and nonlinear programming. Rev. Française Automat. Informat. Recherche Opérationnelle 6, 95-97 (1972)
12. Vandenbussche, D.: Polyhedral Approaches to Solving Nonconvex Quadratic Programs. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, 2003
13. Vandenbussche, D., Nemhauser, G.L.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Technical Report TLI-03-05, Georgia Institute of Technology, 2003. To appear in Math. Prog. 102, 559-575 (2005)
14. Vavasis, S.A.: Nonlinear optimization, Complexity Issues, volume 8 of Internat. Ser. Monogr. Comput. Sci. The Clarendon Press Oxford University Press, New York, 1991
15. Yajima, Y., Fujie, T.: A polyhedral approach for nonconvex quadratic programming problems with box constraints. J. Glob. Optim. 13, 151-170 (1998)