Linear programming and \(\ell _ 1\) regression: A geometric interpretation
From MaRDI portal
Publication:578820
DOI10.1016/0167-9473(87)90050-8zbMath0624.62067OpenAlexW2042373493MaRDI QIDQ578820
Lawrence M. Seiford, J. J. Brennan
Publication date: 1987
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-9473(87)90050-8
Related Items
Lagrangian approach for large-scale least absolute value estimation, Least absolute value regression: recent contributions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal Estimation of Executive Compensation by Linear Programming
- Two Linear Programming Algorithms for the Linear Discrete L 1 Norm Problem
- A revised simplex algorithm for the absolute deviation curve fitting problem
- A new descent algorithm for the least absolute value regression problem
- Least Absolute Deviations Curve-Fitting
- An Efficient Method for the Discrete Linear L 1 Approximation Problem
- An Algorithm for a Restricted Discrete Approximation Problem in the $L_1 $ Norm
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- Asymptotic Theory of Least Absolute Error Regression
- On Least Squares with Insufficient Observations
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
- Pseudo-Inverses in the Analysis of Variance
- SOME THEOREMS IN LEAST SQUARES