Newton's method and quasi-Newton—SQP method for general LC1 constrained optimization

摘要

In this paper we study the second-order sufficient and necessary conditions for LC1 constrained optimization problems, present Newton methods and quasi-Newton-SQP methods for this kind of problems, and establish locally linear and superlinear convergence. This work extends the classical theory of convex smooth minimization to general LC1 constrained optimization.