An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
Frank E. Curtis, Olaf Schenk, Andreas Wächter · SIAM Journal on Scientific Computing · 2010
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses iterative linear system solvers. Inexact step computations are supported in order to save computational expense during each iteration. The algorithm is an interior-point approach derived from an inexact Newton method for equality constrained optimization proposed by Curtis, Nocedal, and Wächter [SIAM J. Optim., 20 (2009), pp. 1224–1249], with additional functionality for handling inequality constraints. The algorithm is shown to be globally convergent under loose assumptions. Numerical results are presented for nonlinear optimization test set collections and a pair of PDE-constrained model problems.
Cited by 57 works. doi:10.1137/090747634
Authors
References
- Numerical optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Optimal control theory : an introduction
- Inexact Newton Methods
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Practical Methods for Optimal Control using Nonlinear Programming
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- A trust region method based on interior point techniques for nonlinear programming
- CUTE