WEKO3
アイテム
Revisions of Constraints Approximation in the Successive QP Method for Nonlinear Programming Problems
https://grips.repo.nii.ac.jp/records/1360
https://grips.repo.nii.ac.jp/records/1360b823aa0b-987c-44c2-9d1e-9971955e15c4
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
82-B-1.pdf (361.7 kB)
|
|
| Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2016-04-13 | |||||||
| タイトル | ||||||||
| タイトル | Revisions of Constraints Approximation in the Successive QP Method for Nonlinear Programming Problems | |||||||
| 言語 | en | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Nonlinear Programming | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Successive Quadratic Programming Method | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Linear Approximations | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Start Procedure | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Exact Penalty Function | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | departmental bulletin paper | |||||||
| その他（別言語等）のタイトル | ||||||||
| その他のタイトル | Abbreviated title: Constraints Approximation for Nonlinear Programming | |||||||
| 言語 | en | |||||||
| 著者 |
TONE, Kaoru
× TONE, Kaoru
|
|||||||
| 著者別名 | ||||||||
| 識別子Scheme | WEKO | |||||||
| 識別子 | 7839 | |||||||
| 姓名 | 刀根, 薫 | |||||||
| 言語 | ja | |||||||
| 抄録 | ||||||||
| 内容記述タイプ | Abstract | |||||||
| 内容記述 | In the last few years the successive quadratic programming methods proposed by Han and Powell have been widely recognized as excellent means for solving nonlinear programming problems. However, there remain some questions about their linear approximations to the constraints from both theoretical and empirical points of view. In this paper, we propose two revisions of the linear approximation to the constraints and show that the directions generated by the revisions are also descent directions of exact penalty functions of nonlinear programming problems. The new technique can cope better with bad starting points than the usual one. |
|||||||
| 内容記述 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Paper presented at The XI. International Symposium on Mathematical Programming. Bonn, West Germany, August 23-27, 1982 | |||||||
| 書誌情報 |
en : Institute for Policy Science research report. B 巻 82, 号 B-1, 発行日 1982-06 |
|||||||
| 出版者 | ||||||||
| 出版者 | Technology Policy Science, Saitama Univ | |||||||
| 言語 | en | |||||||
| 関連サイト | ||||||||
| 関連タイプ | isVersionOf | |||||||
| 識別子タイプ | DOI | |||||||
| 関連識別子 | https://doi.org/10.1007/BF02592051 | |||||||
| 関連名称 | https://doi.org/10.1007/BF02592051 | |||||||
| 著者版フラグ | ||||||||
| 出版タイプ | AM | |||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||
| 注記 | ||||||||
| 値 | The final publication: Tone, K. "Revisions of constraint approximations in the successive QP method for nonlinear programming problems" Mathematical Programming, 26(2), 1983, 144-152 (DOI: 10.1007/BF02592051) | |||||||
| 著者情報 | ||||||||
| 表示名 | https://www.grips.ac.jp/list/facultyinfo/tone_kaoru/ | |||||||
| URL | https://www.grips.ac.jp/list/facultyinfo/tone_kaoru/ | |||||||
