Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

A decomposition branch and bound approach is considered for the global minimization of an indefinite quadratic function over a polytope. The objective function is a sum of a nonseparable convex part and a separable concave part. In many large-scale problems the number of convex variables is much larger than that of concave variables. Taking advantage of this we use a branch and bound method where branching proceeds by rectangular subdivision of the subspace of concave variables. With the help of an easily constructed convex underestimator of the objective function, a lower bound is obtained by solving a convex quadratic programming problem. Three variants using exhaustive, adaptive and w-subdivision are discussed. Computational results are presented for problems with 10-20 concave variables and up to 200 convex variables.

[1]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[2]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[3]  J. Hiriart-Urruty,et al.  FERMAT Days 85 : mathematics for optimization , 1986 .

[4]  C. Floudas,et al.  Primal-relaxed dual global optimization approach , 1993 .

[5]  Pham Dinh Tao.  Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum , 1984 .

[6]  J. B. Rosen,et al.  A parallel algorithm for partially separable non-convex global minimization: Linear constraints , 1990 .

[7]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[8]  Reiner Horst,et al.  On solving a D.C. programming problem by a sequence of linear programs , 1991, J. Glob. Optim..

[9]  Pham Dinh Tao,et al.  Duality in D.C. (Difference of Convex functions) Optimization. Subgradient Methods , 1988 .

[10]  Christodoulos A. Floudas,et al.  New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints , 1993, J. Glob. Optim..

[11]  P. D. Tao.  Convergence of a subgradient method for computing the bound norm of matrices , 1984 .

[12]  Tao Pham Dinh,et al.  Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions , 1995, Comput. Optim. Appl..