Solving Linear Systems Embedded in Interior Point Methods

摘要

Many interior point methods for convex programming solve an (n+m)×(n+m) linear system in each iteration.In this paper,two iterative methods for solving linear systems are combined together and embeded into interier point methods.Based on that,a hybrid algorithm for solving convex programming problems is proposed.