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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 出版事項: |
Taylor & Francis
2007
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/7559/ http://dx.doi.org/10.1080/10556780600565489 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|