Dual bounding procedures lead to convergent Branch-and-Bound algorithms
Branch-and-Bound methods with dual bounding procedures have recently been used to solve several continuous global optimization problems. we improve results on their convergence theory and give a condition that enables LIS to detect infeasible partition sets from the dual optimal value.
nonconvex duality convergence of branch-and-bound algorithm