WEKO3
アイテム
On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids
http://hdl.handle.net/2261/00074090
http://hdl.handle.net/2261/0007409062debe65-0a0f-4fb4-be3e-defe69562824
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids 1991.pdf (189.3 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-12-14 | |||||
| タイトル | ||||||
| タイトル | On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源 | http://purl.org/coar/resource_type/c_6501 | |||||
| タイプ | journal article | |||||
| 著者 |
IMAI, Hiroshi
× IMAI, Hiroshi |
|||||
| 著者所属 | ||||||
| 著者所属 | Faculty of Science, University of Tokyo | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | The paper proves the polynomiality of the multiplicative penalty function method for linear programming proposed by Iri and Imai. This is accomplished by considering ellipsoids determined by the Hessian at an interior point and centered at the point, and showing that, for any interior point, there is such an ellipsoid contained in the feasible region in which the penalty function is well approximated by a linear function determined by the gradient at the point. | |||||
| 内容記述 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | Special Section PAPER (Special Issue on Discrete Mathematics and Its Applications) | |||||
| 書誌情報 |
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences 巻 E74-A, 号 4, p. 669-671, 発行日 1991-04-25 |
|||||
| 権利 | ||||||
| 権利情報 | copyright©1991 IEICE | |||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| 出版者 | ||||||
| 出版者 | Institute of Electronics, Information and Communication Engineers | |||||
| 関係URI | ||||||
| 識別子タイプ | URI | |||||
| 関連識別子 | https://search.ieice.org/ | |||||
