Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
From MaRDI portal
Publication:1846325
DOI10.1016/0021-9045(73)90030-0zbMath0287.65031OpenAlexW2076360830MaRDI QIDQ1846325
Publication date: 1973
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(73)90030-0
Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items (16)
A least distance algorithm for a smooth strictly convex norm ⋮ Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems ⋮ Properties of the approximate generalized inverses of a class of matrices ⋮ On the characterization of the extremal points of the unit sphere of matrices ⋮ Duality theorem for a generalized Fermat-Weber problem ⋮ An algorithm for computing nonnegative minimal norm solutions ⋮ An algorithm for the best approximation by elements of a polyhedral set in banach spaces ⋮ An algorithm for non-negative norm minimal solutions ⋮ A subgradient projection algorithm ⋮ The distance between two convex sets ⋮ An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm ⋮ Algorithms for solving overdetermined systems of linear equations in the \(\ell_p\)-metric, \(0<p<1\) ⋮ An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities ⋮ An algorithm for non—negative least error minimal norm solutions ⋮ An algorithm for approximation by elements of a cone in a banach space ⋮ A characterization of an element of best simultaneous approximation
Cites Work
This page was built for publication: Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
