Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
- 1 June 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 26 (3) , 693-726
- https://doi.org/10.1137/0726041
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A network penalty methodMathematical Programming, 1991
- An Exact Penalty Method for Constrained, Discrete, Linear $l_\infty $ Data FittingSIAM Journal on Scientific and Statistical Computing, 1983
- Linearly Constrained Discrete I 1 ProblemsACM Transactions on Mathematical Software, 1980
- On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ SenseSIAM Journal on Numerical Analysis, 1978
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear SystemSIAM Journal on Numerical Analysis, 1978
- Linear Programming via a Nondifferentiable Penalty FunctionSIAM Journal on Numerical Analysis, 1976
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]ACM Transactions on Mathematical Software, 1975
- An Improved Algorithm for Discrete $l_1 $ Linear ApproximationSIAM Journal on Numerical Analysis, 1973
- Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equationsCommunications of the ACM, 1968
- Algorithms for bestL 1 andL ∞ linear approximations on a discrete setNumerische Mathematik, 1966