On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
Authors:
- Marucha LaleeMLMarucha Lalee
- Jorge NocedalJNJorge Nocedal
- Todd PlantengaTPTodd Plantenga
- 1 August 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 8 (3) , 682-706
Abstract
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.Keywords
This publication has 32 references indexed in Scilit:
- A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained OptimizationSIAM Journal on Optimization, 1997
- Numerical Methods for Unconstrained Optimization and Nonlinear Equations1996
- CUTEACM Transactions on Mathematical Software, 1995
- Representations of quasi-Newton matrices and their use in limited memory methodsMathematical Programming, 1994
- On the Global Convergence of Trust Region Algorithms Using Inexact Gradient InformationSIAM Journal on Numerical Analysis, 1991
- A Trust Region Algorithm for Nonlinearly Constrained OptimizationSIAM Journal on Numerical Analysis, 1987
- Nonlinear programming via an exact penalty function: Global analysisMathematical Programming, 1982
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear EquationsIMA Journal of Applied Mathematics, 1976
- The N‐Step Iteration ProceduresJournal of Mathematics and Physics, 1955