Global and local convergence of a filter line search method for nonlinear programming.
A framework for proving global convergence for a class of line search filter-type methods for nonlinear programming is presented without assuming that the Jacobian has full rank everywhere. The underlying method is based on the filter concept where trial points are accepted, provided there is a suff...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Taylor & Francis
2007
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/7559/ http://dx.doi.org/10.1080/10556780600565489 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|