William Boyle

A Target-Feasibility Branch-and-Prune Algorithm for Nonconvex Constrained Optimization

We present a branch-and-prune algorithm for nonconvex constrained optimization in which each box is treated as a target-level feasibility problem and solved through an extended Lagrangian saddle-point formulation. The current incumbent objective value $U$ is incorporated directly...