An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm

DOI10.1007/BF01389315MaRDI QIDQ1237502zbMATH OpenFDO

Authors R. W. Owens

Publication date 1977

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/132505

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites work

• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm

Cited in

(4)

• A least distance algorithm for a smooth strictly convex norm
• The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\)
• An algorithm for approximation by elements of a cone in a banach space
• An algorithm for non-negative norm minimal solutions

This page was built for publication: An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237502)