科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce a full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular function to provide the feasibility step and to measure proximity to the central path. The result of polynomial complexity coincides with the best known iteration bound for infeasible interior-point methods.
- 出版日期2011-7
