科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 analysis shows that the algorithms have polynomial iteration complexity.
- 出版日期2009
- 单位南阳理工学院
