Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 57, Issue 1, Pages 115-141Publisher
SPRINGER
DOI: 10.1007/s10898-012-9877-4
Keywords
Global optimization; Reformulation technique; Convex underestimators; Mixed integer nonlinear programming; Twice-differentiable functions; Signomial functions; Piecewise linear functions; alpha BB-underestimator; SGO-algorithm
Funding
- Foundation of Abo Akademi University
Ask authors/readers for more resources
In this paper, we present a global optimization method for solving nonconvex mixed integer nonlinear programming (MINLP) problems. A convex overestimation of the feasible region is obtained by replacing the nonconvex constraint functions with convex underestimators. For signomial functions single-variable power and exponential transformations are used to obtain the convex underestimators. For more general nonconvex functions two versions of the so-called alpha BB-underestimator, valid for twice-differentiable functions, are integrated in the actual reformulation framework. However, in contrast to what is done in branch-and-bound type algorithms, no direct branching is performed in the actual algorithm. Instead a piecewise convex reformulation is used to convexify the entire problem in an extended variable-space, and the reformulated problem is then solved by a convex MINLP solver. As the piecewise linear approximations are made finer, the solution to the convexified and overestimated problem will form a converging sequence towards a global optimal solution. The result is an easily-implementable algorithm for solving a very general class of optimization problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available