On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- 1 June 1986
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 36 (2) , 183-209
- https://doi.org/10.1007/bf02592025
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Maintaining Lu Factors of a General Sparse Matrix.Published by Defense Technical Information Center (DTIC) ,1986
- Distribution of mathematical software via electronic mailACM SIGNUM Newsletter, 1985
- A new release of SPARSPAKACM SIGNUM Newsletter, 1984
- Sparse Matrix Methods in OptimizationSIAM Journal on Scientific and Statistical Computing, 1984
- Numerical Methods for Large Sparse Linear Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1984
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- Solving staircase linear programs by the simplex method, 1: InversionMathematical Programming, 1982
- Yale sparse matrix package I: The symmetric codesInternational Journal for Numerical Methods in Engineering, 1982
- A note on solution of large sparse maximum entropy problems with linear equality constraintsMathematical Programming, 1980
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, 1977