A globally and quadratically convergent affine scaling method for linearℓ 1 problems
- 1 August 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 56 (1-3), 189-222
- https://doi.org/10.1007/bf01580899
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- L/sub 1/ and L/sub infinity / minimization via a variant of Karmarkar's algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- The Null Space Problem II. AlgorithmsSIAM Journal on Algebraic Discrete Methods, 1987
- The Null Space Problem I. ComplexitySIAM Journal on Algebraic Discrete Methods, 1986
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear SystemSIAM Journal on Numerical Analysis, 1978
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977
- An Improved Algorithm for Discrete $l_1 $ Linear ApproximationSIAM Journal on Numerical Analysis, 1973