On the condition numbers for polyhedra in Karmarkar's form

DOI10.1016/S0167-6377(98)00051-0zbMATH Open0955.90090MaRDI QIDQ1306351FDOQ1306351

Levent Tunçel

Publication date: 4 March 2001

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

Recommendations

• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
• On strata of degenerate polyhedral cones. II: Relations between condition measures
• Condition numbers for polyhedra with real number data
• A new condition number for linear programming
• A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems

zbMATH Keywords

linear programmingLP dualitycondition measureKarmarkar's form

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• 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
• Condition numbers for polyhedra with real number data

This page was built for publication: On the condition numbers for polyhedra in Karmarkar's form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306351)