Discrete, linear approximation problems in polyhedral norms-Reference-Cited by-同舟云学术

Discrete, linear approximation problems in polyhedral norms

Published:1976-06 Issue:2 Volume:26 Page:179-189
ISSN:0029-599X
Container-title:Numerische Mathematik
language:en
Short-container-title:Numer. Math.

Author:

Anderson D. H.,Osborne M. R.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics

Link

http://link.springer.com/article/10.1007/BF01395971/fulltext.html

Reference10 articles.

1. Anderson, D. H.: Linear Programming and the Calculation of Maximum Norm Approximations. Ph. D. Thesis, Australian National University, 1975

2. Cheney, E. W.: Introduction to Approximation Theory. New York: McGraw-Hill 1966

3. Gill, P. E., Golub, G. H., Murray, W., Saunders, M. A.: Methods for modifying matrix factorizations. Stanford University Computer Science Department Report STAN-CS-72-322, (1972)

4. Householder, A. S.: The Theory of Matrices in Numerical Analysis. Massachusetts: Blaisdell 1964

5. Madsen, K.: An algorithm for minimax solution of overdetermined systems of nonlinear equations. U. K. AEA Research Report, TP559 (1973)

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

1. Bounding the Distance to Unsafe Sets With Convex Optimization;IEEE Transactions on Automatic Control;2023-12

2. Voronoi polytopes for polyhedral norms on lattices;Discrete Applied Mathematics;2015-12

3. Linear best approximation using a class of polyhedral norms;Numerical Algorithms;1992-10

4. A Descent Algorithm for Minimizing Polyhedral Convex Functions;SIAM Journal on Scientific and Statistical Computing;1983-12

5. A finite algorithm for the rank regression problem;Journal of Applied Probability;1982