Computing Karmarkar's projections quickly by using matrix factorization

DOI10.1007/BF02664803zbMATH Open0858.90094MaRDI QIDQ1815744FDOQ1815744

Heng-Yong Tang, John R. Birge

Publication date: 12 December 1996

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

zbMATH Keywords

matrix factorizationKarmarkar's projections

Mathematics Subject Classification ID

Linear programming (90C05) Theory of matrix inversion and generalized inverses (15A09)

Cites Work

• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Interior path following primal-dual algorithms. I: Linear programming
• Efficient solution of two-stage stochastic linear programs using interior point methods
• An implementation of Karmarkar's algorithm for linear programming
• Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• On the Modification of LDL T Factorizations
• Computing Karmarkar projections quickly

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Computing Karmarkar's projections quickly by using matrix factorization

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