Discrete, linear approximation problems in polyhedral norms
- 1 June 1976
- journal article
- research article
- Published by Springer Nature in Numerische Mathematik
- Vol. 26 (2), 179-189
- https://doi.org/10.1007/bf01395971
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Linear programming and the calculation of maximum norm approximationsBulletin of the Australian Mathematical Society, 1976
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear EquationsIMA Journal of Applied Mathematics, 1975
- The Calculation of Best Restricted ApproximationsSIAM Journal on Numerical Analysis, 1974
- On an algorithm for discrete nonlinear L1 approximationThe Computer Journal, 1971
- On the Best Linear Chebyshev ApproximationThe Computer Journal, 1967
- Note on Jordan elimination, linear programming and Tchebycheff approximationNumerische Mathematik, 1960
- Über diskrete und lineare Tschebyscheff-ApproximationenNumerische Mathematik, 1959