On the condition numbers for polyhedra in Karmarkar's form

DOI10.1016/S0167-6377(98)00051-0zbMath0955.90090MaRDI QIDQ1306351

Tunçel, Levent

Publication date: 4 March 2001

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

linear programmingLP dualitycondition measureKarmarkar's form

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Interior-point methods (90C51)

Related Items

A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms

Cites Work

• A new polynomial-time algorithm for linear programming
• On bounds for scaled projections and pseudoinverses
• A geometric property of the least squares solution of linear equations
• On scaled projections and pseudoinverses
• A primal-dual interior point method whose running time depends only on the constraint matrix
• A note on properties of condition numbers
• Condition numbers for polyhedra with real number data
• Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
• Stable Numerical Algorithms for Equilibrium Systems
• A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm