Computing projections for the Karmarkar algorithm
From MaRDI portal
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
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A variable-metric variant of the Karmarkar algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- The Factorization of Sparse Symmetric Indefinite Matrices
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
Cited in
(9)- The role of the augmented system in interior point methods
- scientific article; zbMATH DE number 4037557 (Why is no real title available?)
- Computing projections with LSQR
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Computational performance of a projection and rescaling algorithm
- An algorithm for finding projections with extreme kurtosis
- Loss and retention of accuracy in affine scaling methods
- scientific article; zbMATH DE number 11760 (Why is no real title available?)
- LOQO:an interior point code for quadratic programming
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)
