A Branch and Bound Algorithm for the Global Optimization of Hessian Lipschitz Continuous Functions
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 overlappin...
| Principais autores: | , , |
|---|---|
| Formato: | Journal article |
| Publicado em: |
2012
|
Search Result 1
A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
Publicado em 2012
Journal article