ISSN:
1573-2916
Keywords:
Global optimization
;
constrained optimization
;
convex relaxation
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01099647
Permalink