An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm
From MaRDI portal
Publication:1237502
DOI10.1007/BF01389315zbMath0356.65030MaRDI QIDQ1237502
Publication date: 1977
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132505
Related Items
A least distance algorithm for a smooth strictly convex norm ⋮ An algorithm for non-negative norm minimal solutions ⋮ An algorithm for approximation by elements of a cone in a banach space ⋮ The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
Cites Work