Two condition numbers described b y Y e, Vavasis, Stewart, Todd and others have been used t o stu... more Two condition numbers described b y Y e, Vavasis, Stewart, Todd and others have been used t o study the complexity of interior point algorithms. The one is given by the \smallest large variable" in the optimal face of the linear programming problem, and the other by the supreme of the norms of all the oblique projection operators on the range space o f A T . The one has the disadvantage of depending on the knowledge of the optimal partition, and the second depends only on the data but does not use the structure of the linear programming problem. We give a characterization of the rst one, based on the edges of the feasible polyhedron, which does not depend on the knowledge of the optimal partition.
Two condition numbers described b y Y e, Vavasis, Stewart, Todd and others have been used t o stu... more Two condition numbers described b y Y e, Vavasis, Stewart, Todd and others have been used t o study the complexity of interior point algorithms. The one is given by the \smallest large variable" in the optimal face of the linear programming problem, and the other by the supreme of the norms of all the oblique projection operators on the range space o f A T . The one has the disadvantage of depending on the knowledge of the optimal partition, and the second depends only on the data but does not use the structure of the linear programming problem. We give a characterization of the rst one, based on the edges of the feasible polyhedron, which does not depend on the knowledge of the optimal partition.
Uploads
Papers by Hugo Jose Lara Urdaneta