Abstract
Global convergence to first-order critical points is
proved for a variant of the trust-region SQP-filter
algorithm analyzed in Fletcher, Gould, Leyffer, Toint and Waechter (2002). This variant allows the use of two types of step
strategies: the first decomposes the step into its normal
and tangential components, while the second replaces this
decomposition by a stronger condition on the associated
model decrease
Original language | English |
---|---|
Title of host publication | System Modeling and Optimization XX |
Editors | E Sachs, R Tichatschke |
Place of Publication | Dordrecht, NL |
Publisher | Kluwer Academic Publishers |
Pages | 23-54 |
Number of pages | 32 |
ISBN (Print) | 1-4020-7565-0 |
Publication status | Published - 2003 |
Keywords
- Filter methods
- nonlinear optimization
- convergence theory.
- sequential quadratic programming