Computing Karmarkar's projections quickly by using matrix factorization

DOI10.1007/BF02664803MaRDI QIDQ1815744zbMATH OpenFDO

Authors John R. Birge, Heng-Yong Tang

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

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

Cited in

(1)

• scientific article; zbMATH DE number 5812144 (Why is no real title available?)

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)