Methodology and analysis for comparing discrete linear l1approximation codes-Reference-Cited by-同舟云学术

Methodology and analysis for comparing discrete linear l1approximation codes

Published:1977-01 Issue:4 Volume:6 Page:399-413
ISSN:0361-0918
Container-title:Communications in Statistics - Simulation and Computation
language:en
Short-container-title:Communications in Statistics - Simulation and Computation

Author:

Gilsinn J.,Hoffman K.,Jackson R. H. F.,Leyendecker E.,Saunders P.,Shier D.

Publisher

Informa UK Limited

Subject

Modeling and Simulation,Statistics and Probability

Link

http://www.tandfonline.com/doi/pdf/10.1080/03610917708812053

Reference8 articles.

1. A Comparison of Two Algorithms for Absolute Deviation Curve Fitting

2. Barrodale, I. and F.D.K. Roberts (1972). An improved algorithm for discrete L1 approximation. MRC Tech. Report 1172, The University of Wisconsin, Madison.

3. Bartels, R.H. and A.R. Conn (1976). Linear constrained discrete L1 problems. Tech. Report 248, Dept. of Math. Sciences, Johns Hopkins University, Baltimore, Maryland.

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Statistical Analysis of Computational Tests of Algorithms and Heuristics;INFORMS Journal on Computing;2000-02

2. Designing and reporting on computational experiments with heuristic methods;Journal of Heuristics;1995-09

3. ON REPORTING THE SPEEDUP OF PARALLEL ALGORITHMS: A SURVEY OF ISSUES AND EXPERTS;Computer Science and Operations Research;1992

4. Guidelines for reporting results of computational experiments. Report of the ad hoc committee;Mathematical Programming;1990-11

5. An assumption‐free convergence analysis for a perturbation of the scaling algorithm for linear programs, with application to the L 1 estimation problem;Naval Research Logistics (NRL);1988-10