Computing projections for the Karmarkar algorithm
From MaRDI portal
Publication:806966
DOI10.1016/0024-3795(91)90272-XzbMATH Open0729.65043MaRDI QIDQ806966FDOQ806966
Authors: Kathryn Turner 
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- Computing Karmarkar projections quickly
- Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks
- Some experiments with Karmarkar's algorithm for linear programming
- Publication:3486755
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- The Factorization of Sparse Symmetric Indefinite Matrices
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A variable-metric variant of the Karmarkar algorithm for linear programming
Cited In (9)
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing projections with LSQR
- Computational performance of a projection and rescaling algorithm
- LOQO:an interior point code for quadratic programming
- Loss and retention of accuracy in affine scaling methods
- The role of the augmented system in interior point methods
- An algorithm for finding projections with extreme kurtosis
Uses Software
This page was built for publication: Computing projections for the Karmarkar algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806966)
