A Faster Method For Computing Karmarkar's Projections For Large Number of Constraints

DOI10.1080/02331939708844319zbMATH Open0873.90068OpenAlexW2073801003MaRDI QIDQ4342964FDOQ4342964

Authors:

Publication date: 20 October 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844319

Recommendations

• Computing Karmarkar projections quickly
• Solving linear systems involved in constrained optimization
• Karmarkar's projective method for linear programming: a computational survey
• Karmarkar's algorithm and its place in applied mathematics

zbMATH Keywords

interior point methodslinear regressionQR factorizationKarmarkar's method

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• A new polynomial-time algorithm for linear programming
• Computing Karmarkar projections quickly
• A quadratically convergent method for linear programming

Cited In (1)

• Solving linear systems involved in constrained optimization

This page was built for publication: A Faster Method For Computing Karmarkar's Projections For Large Number of Constraints

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