On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization

This paper describes a software implementation of Byrd and Omojokun's trust region algorithm for solving nonlinear equality constrained optimization problems. The code is designed for the efficient solution of large problems and provides the user with a variety of linear algebra techniques for solving the subproblems occurring in the algorithm. Second derivative information can be used, but when it is not available, limited memory quasi-Newton approximations are made. The performance of the code is studied using a set of difficult test problems from the CUTE collection.

[1]  E. J. Craig.  The N‐Step Iteration Procedures , 1955 .

[2]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

[3]  I. Duff,et al.  A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations , 1976 .

[4]  N. Maratos,et al.  Exact penalty function algorithms for finite dimensional and control optimization problems , 1978 .

[5]  M. J. D. Powell,et al.  THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS , 1978 .

[6]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[7]  John K. Reid,et al.  Some Design Features of a Sparse Matrix Code , 1979, TOMS.

[8]  Philippe L. Toint,et al.  Towards an efficient sparsity exploiting newton method for minimization , 1981 .

[9]  Andrew R. Conn,et al.  Nonlinear programming via an exact penalty function: Global analysis , 1982, Math. Program..

[10]  Richard H. Byrd,et al.  A Family of Trust Region Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties. , 1985 .

[11]  R. Dembo,et al.  INEXACT NEWTON METHODS , 1982 .

[12]  R. Fletcher,et al.  Second order corrections for non-differentiable optimization , 1982 .

[13]  T. Steihaug.  The Conjugate Gradient Method and Trust Regions in Large Scale Optimization , 1983 .

[14]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[15]  Richard A. Tapia,et al.  A trust region strategy for nonlinear equality constrained op-timization , 1984 .

[16]  A. Vardi.  A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation , 1985 .

[17]  Richard H. Byrd,et al.  A Trust Region Algorithm for Nonlinearly Constrained Optimization , 1987 .

[18]  Ya-Xiang Yuan,et al.  A recursive quadratic programming algorithm that uses differentiable exact penalty functions , 1986, Math. Program..

[19]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[20]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[21]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[22]  Claude Lemaréchal,et al.  Some numerical experiments with variable-storage quasi-Newton algorithms , 1989, Math. Program..

[23]  E. Omojokun.  Trust region algorithms for optimization with nonlinear equality and inequality constraints , 1990 .

[24]  J. Dennis,et al.  A robust trust region algorithm for nonlinear programming , 1990 .

[25]  J. Z. Zhang,et al.  Projected quasi-Newton algorithm with trust region for constrained optimization , 1990 .

[26]  Ya-Xiang Yuan,et al.  On a subproblem of trust region algorithms for constrained optimization , 1990, Math. Program..

[27]  M. El-Alem.  A global convergence theory for the Celis-Dennis-Tapia trust-region algorithm for constrained optimization , 1991 .

[28]  Ya-Xiang Yuan,et al.  A trust region algorithm for equality constrained optimization , 1990, Math. Program..

[29]  R. Carter.  On the global convergence of trust region algorithms using inexact gradient information , 1991 .

[30]  Barry W. Peyton,et al.  Block sparse Cholesky algorithms on advanced uniprocessor computers , 1991 .

[31]  P. Toint,et al.  Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .

[32]  Matthias Heinkenschloss.  On the solution of a two ball trust region subproblem , 1992, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[33]  Yin Zhang,et al.  Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization , 1992, Math. Program..

[34]  Sanjay Mehrotra,et al.  Solving symmetric indefinite systems in an interior-point method for linear programming , 1993, Math. Program..

[35]  T. Plantenga.  Large-scale nonlinear constrained optimization using trust regions , 1994 .

[36]  Jorge Nocedal,et al.  Representations of quasi-Newton matrices and their use in limited memory methods , 1994, Math. Program..

[37]  Mahmoud El-Alem,et al.  A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization , 1995, SIAM J. Optim..

[38]  Nicholas I. M. Gould,et al.  CUTE: constrained and unconstrained testing environment , 1995, TOMS.

[39]  Jorge Nocedal,et al.  Large-scale constrained optimization , 1996 .

[40]  John E. Dennis,et al.  A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization , 1997, SIAM J. Optim..

[41]  Todd Plantenga,et al.  A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques , 1998, SIAM J. Sci. Comput..

[42]  Jorge Nocedal,et al.  A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..