An algorithm for finding the global maximum of a multimodal, multivariate function
Mathematical Programming: Series A and B
On the convergence of global methods in multiextremal optimization
Journal of Optimization Theory and Applications
A deterministic algorithm for global optimization
Mathematical Programming: Series A and B
On generalized bisection of n-simplices
Mathematics of Computation
On convergence of the simplicial branch-and-bound algorithm based on &ohgr;-subdivisions
Journal of Optimization Theory and Applications
A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs
Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Journal of Global Optimization
On determining the cover of a simplex by spheres centered at its vertices
Journal of Global Optimization
Hi-index | 0.00 |
In this paper, the use of non-optimality spheres in a simplicial branch and bound (B&B) algorithm is investigated. In this context, some considerations regarding the use of bisection on the longest edge in relation with ideas of Reiner Horst are reminded. Three arguments highlight the merits of bisection of simplicial subsets in B&B schemes.