Journal of Global Optimization
A new global optimization method for univariate constrained twice-differentiable NLP problems
Journal of Global Optimization
Journal of Global Optimization
Tight convex underestimators for $${{\mathcal C}^2}$$-continuous problems: I. univariate functions
Journal of Global Optimization
A review of recent advances in global optimization
Journal of Global Optimization
Convex relaxation for solving posynomial programs
Journal of Global Optimization
Solutions to quadratic minimization problems with box and integer constraints
Journal of Global Optimization
Continuous GRASP with a local active-set method for bound-constrained global optimization
Journal of Global Optimization
Convergence rate of McCormick relaxations
Journal of Global Optimization
A reformulation framework for global optimization
Journal of Global Optimization
Hi-index | 0.00 |
In Akrotirianakis and Floudas (2004) we presented the theoretical foundations of a new class of convex underestimators for C2 nonconvex functions. In this paper, we present computational experience with those underestimators incorporated within a Branch-and-Bound algorithm for box-conatrained problems. The algorithm can be used to solve global optimization problems that involve C2 functions. We discuss several ways of incorporating the convex underestimators within a Branch-and-Bound framework. The resulting Branch-and-Bound algorithm is then used to solve a number of difficult box-constrained global optimization problems. A hybrid algorithm is also introduced, which incorporates a stochastic algorithm, the Random-Linkage method, for the solution of the nonconvex underestimating subproblems, arising within a Branch-and-Bound framework. The resulting algorithm also solves efficiently the same set of test problems.