An algorithm for best approximate solutions ofAx=b with a smooth strictly convex norm
- 1 March 1977
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 29 (1) , 83-91
- https://doi.org/10.1007/bf01389315
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex normJournal of Approximation Theory, 1973
- Algorithms for bestL 1 andL ∞ linear approximations on a discrete setNumerische Mathematik, 1966