Lagrangian stability and global optimality in nonconvex quadratic minimization over Euclidean balls and spheres.
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
The purpose of this paper is to demonstrate that, for globally minimize one dimensional nonconvex problems with both twice differentiable function and constraint, we can propose an efficient algorithm based on Branch and Bound techniques. The method is first displayed in the simple case with an interval constraint. The extension is displayed afterwards to the general case with an additional nonconvex twice differentiable constraint. A quadratic bounding function which is better than the well known...
Page 1