A Technique that Gains Speed and Accuracy in the Minimax Solution of Overdetermined Linear Equations-Reference-Cited by-同舟云学术

A Technique that Gains Speed and Accuracy in the Minimax Solution of Overdetermined Linear Equations

Published:1977 Issue: Volume: Page:15-33
ISSN:
Container-title:Mathematical Software
language:
Short-container-title:

Author:

Hopper M.J.,Powell M.J.D.

Publisher

Elsevier

Reference10 articles.

1. “The optimal exchange algorithm and comparisons with the generalized Remes algorithm”;Anselone;Applicable Analysis,1973

2. I. Barrodale and C. Phillips (1975) “An improved algorithm for discrete Chebyshev linear approximation” in “Proceedings of the Fourth Manitoba Conference on Numerical Mathematics” (Utalitas Mathematica Publishing Inc., Winnipeg).

3. “An improved algorithm for discrete L1, linear approximation”;Barrodale;SIAM J. Numer. Anal.,1973

4. “A numerically stable form of the simplex algorithm”;Gill;Linear Algebra and its Applics.,1973

5. K. Madsen and M. J. D. Powell (1975) “A Fortran subroutine that calculates the minimax solution of linear equations subject to bounds on the variables”, Report R. 7954 (A.E.R.E. Harwell).

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

1. Michael J.D. Powell’s work in approximation theory and optimisation;Journal of Approximation Theory;2019-02

2. A proximal point algorithm for minimax problems;BIT Numerical Mathematics;1997-09

3. On degeneracy in linear programming and related problems;Annals of Operations Research;1993-09

4. On Generating Discrete Linear $l_\infty $ Test Problems;SIAM Journal on Scientific and Statistical Computing;1989-05

5. On the solution of highly degenerate linear programmes;Mathematical Programming;1988-05