An assumption‐free convergence analysis for a perturbation of the scaling algorithm for linear programs, with application to the L 1 estimation problem
- 10 October 1988
- journal article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 35 (5) , 473-492
- https://doi.org/10.1002/1520-6750(198810)35:5<473::aid-nav3220350511>3.0.co;2-#
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Convergence results and numerical experiments on a linear programming hybrid algorithmEuropean Journal of Operational Research, 1987
- A modification of karmarkar's linear programming algorithmAlgorithmica, 1986
- A new descent algorithm for the least absolute value regression problemCommunications in Statistics - Simulation and Computation, 1981
- Linearly Constrained Discrete I 1 ProblemsACM Transactions on Mathematical Software, 1980
- A Test Problem Generator for Discrete Linear L 1 Approximation ProblemsACM Transactions on Mathematical Software, 1980
- L 1 solution of overdetermined systems of linear equationsACM Transactions on Mathematical Software, 1980
- A revised simplex algorithm for the absolute deviation curve fitting problemCommunications in Statistics - Simulation and Computation, 1979
- Methodology and analysis for comparing discrete linear l1approximation codesCommunications in Statistics - Simulation and Computation, 1977
- Algorithms for restricted least absolute value estimationCommunications in Statistics - Simulation and Computation, 1977
- Algorithm 458: discrete linear L 1 approximation by interval linear programmingCommunications of the ACM, 1973