WEKO3
アイテム
Worst case bounds on facial reduction for conic programming
https://doi.org/10.15018/00000958
https://doi.org/10.15018/000009580f8d8bb4-dbc5-4153-8e5e-c8ed4a001efb
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
rikougaku-53-2_15-20.pdf (945.6 KB)
|
|
| Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2017-04-19 | |||||||||||
| タイトル | ||||||||||||
| タイトル | Worst case bounds on facial reduction for conic programming | |||||||||||
| 言語 | en | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| 資源タイプ | departmental bulletin paper | |||||||||||
| その他 資源タイプ | Article | |||||||||||
| 著者 |
Lourenço, Bruno Figueira
× Lourenço, Bruno Figueira
× Muramatsu, Masakazu
× Tsuchiya, Takashi
|
|||||||||||
| 書誌情報 |
ja : 成蹊大学理工学研究報告 en : The journal of the Faculty of Science and Technology, Seikei University 巻 53, 号 2, p. 15-20, 発行日 2016-12 |
|||||||||||
| 出版者 | ||||||||||||
| 出版者 | 成蹊大学理工学部 | |||||||||||
| 言語 | ja | |||||||||||
| 出版タイプ | ||||||||||||
| 出版タイプ | VoR | |||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | PISSN | |||||||||||
| 収録物識別子 | 1880-2265 | |||||||||||
| NCID | ||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||
| 収録物識別子 | AA1203510X | |||||||||||
| アクセス権 | ||||||||||||
| アクセス権 | open access | |||||||||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||||||
| キーワード | ||||||||||||
| 言語 | en | |||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | conic linear programming | |||||||||||
| キーワード | ||||||||||||
| 言語 | en | |||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | facial reduction | |||||||||||
| ID登録 | ||||||||||||
| ID登録 | 10.15018/00000958 | |||||||||||
| ID登録タイプ | JaLC | |||||||||||
| 抄録 | ||||||||||||
| 内容記述タイプ | Abstract | |||||||||||
| 内容記述 | Conic linear programming is a powerful modelling technique with many applications in engineering, planning, statistics and many others. Typically, a conic linear program (CLP) is expressed as the task of minimizing some linear function subject to linear equations and conic constraints. Sometimes, however, the CLPs can exhibit nasty theoretical behavior. This is where regularization techniques come to play. They fix ill-behaved problems and put them in a shape that solvers can successfully handle them. In this note, we present a brief account of Facial Reduction Algorithms and discuss worst case bounds for their termination. | |||||||||||
| 言語 | en | |||||||||||
