A quadratically approximate framework for constrained optimization,global and local convergence

This paper presents a quadratically approximate algorithm framework (QAAF) for solving general constrained optimization problems, which solves, at each iteration, a subproblem with quadratic objective function and quadratic equality together with inequality constraints. The global convergence of the algorithm framework is presented under the Mangasarian-Fromovitz constraint qualification (MFCQ), and the conditions for superlinear and quadratic convergence of the algorithm framework are given under the MFCQ, the constant rank constraint qualification (CRCQ) as well as the strong second-order sufficiency conditions (SSOSC). As an incidental result, the definition of an approximate KKT point is brought forward, and the global convergence of a sequence of approximate KKT points is analysed. Projects supported by NSFC (Nos. 10261001, 10771040) and Guangxi Province Science Foundation (No. 0640001)