A global convergence analysis of an algorithm for large-scale nonlinear optimization problems

In this paper we give a global convergence analysis of a basic version of a n SQP algorithm described in [P. T. Boggs, A. J. Kearsley, and J. W. Tolle, SIAM J. Optim., 9 (1999), pp. 755-778] for the solution of large-scale non linear inequality-constrained optimization problems. Several procedures and options have been added to the basic algorithm to improve the practical pe rformance; some of these are also analyzed. The important features of the a lgorithm include the use of a constrained merit function to assess the prog ress of the iterates and a sequence of approximate merit functions that are less expensive to evaluate. It also employs an interior point quadratic pr ogramming solver that can be terminated early to produce a truncated step.