Newton’s Method for Minimizing a Convex Twice Differentiable Function on a Preconvex Set

Abstract

The problem of minimizing a convex twice differentiable function on the set-theoretic difference between a convex set and the union of several convex sets is considered. A generalization of Newton’s method for solving problems with convex constraints is proposed. The convergence of the algorithm is analyzed.