A T-algebraic approach to primal-dual interior-point algorithms
Three primal-dual interior-point algorithms for homogeneous cone programming are presented. They are a short-step algorithm, a large-update algorithm, and a predictor-corrector algorithm. These algorithms are described and analyzed based on a characterization of homogeneous cones via T-algebras. The...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2009
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/80187 http://hdl.handle.net/10220/6019 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |