Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)
A new global optimization method for univariate constrained twice-differentiable NLP problems
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
A reformulation framework for global optimization
Journal of Global Optimization
Hi-index | 0.00 |
This paper describes the construction of convex underestimators for twice continuously differentiable functions over box domains through piecewise quadratic perturbation functions. A refinement of the classical 驴 BB convex underestimator, the underestimators derived through this approach may be significantly tighter than the classical 驴BB underestimator. The convex underestimator is the difference of the nonconvex function f and a smooth, piecewise quadratic, perturbation function, q. The convexity of the underestimator is guaranteed through an analysis of the eigenvalues of the Hessian of f over all subdomains of a partition of the original box domain. Smoothness properties of the piecewise quadratic perturbation function are derived in a manner analogous to that of spline construction.