Abstract
The design and implementation of a new algorithm for solving large nonlinear programming problems is described. It follows a barrier approach that employs sequential quadratic programming and trust regions to solve the subproblems occurring in the iteration. Both primal and primal-dual versions of the algorithm are developed, and their performance is illustrated in a set of numerical tests.
Original language | English (US) |
---|---|
Pages (from-to) | 877-900 |
Number of pages | 24 |
Journal | SIAM Journal on Optimization |
Volume | 9 |
Issue number | 4 |
DOIs | |
State | Published - Sep 1999 |
Keywords
- Barrier method
- Constrained optimization
- Interior point method
- Large-scale optimization
- Nonlinear programming
- Primal method
- Primal-dual method
- Sequential quadratic programming
- Trust region method
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Applied Mathematics