References
- Abdelmalek, N. M., 1971. Linear L1, approximation for a discrete point set and L1 solutions of overdetermined linear equations, J, Assoc, Comput, Mach 18 (1971), pp. 7–4l.
- Armstrong, R. D., and Frome, E. L., 1976. A Comparison of two algorithms for absolute deviation curve fitting, J. Amer, Statist, Assoc 71 (1976), pp. 30–328.
- Barrodale, I., and Roberts, F. D. K., 1973. An improved algorithm for discrete L1 linear approximation, SIAM J. Numer. Anal 10 (1973), pp. 48–839.
- Barrodale, I., and Young, A., 1966. Algorithms for best L1 and L∞ linear approximation on a discrete set, Numer. Math 8 (1966), pp. 295–306.
- Bartels, R. H., and Golub, G. H., 1969. The simplex method of linear programming using LU decomposition, Communications of the ACM 12 (1969), pp. 8–266.
- Barrodale, I., and Roberts, F. D. K., 1974. Solution of an over-determined system of equations in the L1 norm, Communications of the ACM 17 (1974), pp. 20–319.
- Charnes, A., Cooper, W. W., and Ferguson, R., 1955. Optimal estimation of executive compensation by linear programming, Management Sci 7 (1955), pp. 51–138.
- Robers, P. D., and Ben-Israel, A., 1969. An interval programming algorithm for discrete linear L1 approximation problems, J. Approx, Theory 2 (1969), pp. 36–323.
- Schlossmacher, E. J., 1973. An iterative technique for absolute deviations curve fitting, J. Amer. Statist, Assoc 68 (1973), pp. 9–857.
- Spyropoulos, K., Kiountouzis, E., and Young, A., 1973. Discrete approximations in the L1 norm, Computer J 16 (1973), pp. 6–180.
- Usow, K. H., 1967. On L1 approximation II; computation for discrete functions and discretization effects, SIAM J. Numer Anal 4 (1967), pp. 44–233.
- Wagner, H. M., 1959. Linear programming techniques for regression analysis, J. Amer, Statist. Assoc 54 (1959), pp. 12–206.