αBB: A global optimization method for general constrained nonconvex problems

A branch and bound global optimization method,αBB, for general continuous optimization problems involving nonconvexities in the objective function and/or constraints is presented. The nonconvexities are categorized as being either of special structure or generic. A convex relaxation of the original nonconvex problem is obtained by (i) replacing all nonconvex terms of special structure (i.e. bilinear, fractional, signomial) with customized tight convex lower bounding functions and (ii) by utilizing the α parameter as defined in [17] to underestimate nonconvex terms of generic structure. The proposed branch and bound type algorithm attains finiteε-convergence to the global minimum through the successive subdivision of the original region and the subsequent solution of a series of nonlinear convex minimization problems. The global optimization method,αBB, is implemented in C and tested on a variety of example problems.

[1]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[2]  Christodoulos A. Floudas,et al.  Finding all solutions of nonlinearly constrained systems of equations , 1995, J. Glob. Optim..

[3]  Hanif D. Sherali,et al.  A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[6]  C. Floudas,et al.  Global Optimization in Generalized Geometric Programming , 1997, Encyclopedia of Optimization.

[7]  Ronald R. Willis,et al.  New Computer Methods for Global Optimization , 1990 .

[8]  Panos M. Pardalos,et al.  Recent Advances in Global Optimization , 1991 .

[9]  Reiner Horst,et al.  A new simplicial cover technique in constrained global optimization , 1992, J. Glob. Optim..

[10]  Pierre Hansen,et al.  Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison , 1989, Math. Program..

[11]  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..

[12]  Reiner Horst,et al.  The Geometric Complementarity Problem and Transcending Stationarity in Global Optimization , 1990, Applied Geometry And Discrete Mathematics.

[13]  Christodoulos A. Floudas,et al.  Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem , 1994, J. Glob. Optim..

[14]  H. Tuy,et al.  A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set , 1985, Math. Oper. Res..

[15]  G. T. Timmer,et al.  Stochastic global optimization methods part I: Clustering methods , 1987, Math. Program..

[16]  Aharon Ben-Tal,et al.  Global minimization by reducing the duality gap , 1994, Math. Program..

[17]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

[18]  R. Horst,et al.  On the convergence of global methods in multiextremal optimization , 1987 .

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

[20]  Pierre Hansen,et al.  Global optimization of univariate Lipschitz functions: I. Survey and properties , 1989, Math. Program..

[21]  Ramon E. Moore,et al.  Rigorous methods for global optimization , 1992 .

[22]  H. Tuy.  Global Minimization of a Difference of Two Convex Functions , 1987 .

[23]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[24]  C. Floudas,et al.  A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory , 1990 .

[25]  Hanif D. Sherali,et al.  A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..

[26]  C. A. Haverly.  Studies of the behavior of recursion for the pooling problem , 1978, SMAP.

[27]  F. Al-Khayyal.  Jointly constrained bilinear programs and related problems: an overview , 1990 .

[28]  Christodoulos A Floudas,et al.  Global minimum potential energy conformations of small molecules , 1994, J. Glob. Optim..

[29]  Venkat Venkatasubramanian,et al.  A genetic algorithmic framework for process design and optimization , 1991 .

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

[31]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[32]  N. Shor.  Dual quadratic estimates in polynomial and Boolean programming , 1991 .