We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an overlapping branch and bound algorithm for convex constrained global optimization. Unlike other branch and bound algorithms, lower bounds are obtained via nonconvex underestimators of the function. For a numerical example, we apply the proposed branch and bound algorithm to radial basis function approximations.
Technical Report RAL-TR-2011-0200 Rutherford Appleton Laboratory, Chilton, Oxfordshire OX11 0QX, England
View A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions