科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper proposes an infeasible interior-point algorithm for linear complementarity problem with full-Newton steps.The main iteration consists of a feasibility step and several centrality steps.No more than O(n log(n /))iterations are required for getting an-solution of the problem at hand,which coincides with the best-known bound for infeasible interior-point algorithms.
- 出版日期2013-6-24
