Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- First Online:
- Cite this article as:
- Kirst, P., Stein, O. & Steuermann, P. TOP (2015) 23: 591. doi:10.1007/s11750-015-0387-7
- 148 Downloads
We discuss some difficulties in determining valid upper bounds in spatial branch-and-bound methods for global minimization in the presence of nonconvex constraints. In fact, two examples illustrate that standard techniques for the construction of upper bounds may fail in this setting. Instead, we propose to perturb infeasible iterates along Mangasarian–Fromovitz directions to feasible points whose objective function values serve as upper bounds. These directions may be calculated by the solution of a single linear optimization problem per iteration. Preliminary numerical results indicate that our enhanced algorithm solves optimization problems where a standard branch-and-bound method does not converge to the correct optimal value.