A least distance algorithm for a smooth strictly convex norm

DOI10.1080/00207160008804997zbMath0969.65034OpenAlexW2069327343MaRDI QIDQ4521951

V. P. Sreedharan, Said Bahi

Publication date: 25 September 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804997

zbMATH Keywords

global convergencenonnegative solutioninconsistent linear systemleast distance algorithmsmooth strictly convex norm

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (1)

An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgradient projection algorithm. II
• Extensions of subgradient projection algorithms
• \(\epsilon\)-subgradient projection algorithm
• A subgradient projection algorithm
• An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm
• Least squares methods to minimize errors in a smooth, strictly convex norm on \({\mathbb{R}}^ m\)
• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
• An algorithm for non-negative norm minimal solutions
• An algorithm for approximation by elements of a cone in a banach space
• An algorithm for computing nonnegative minimal norm solutions
• The calculation of linear best Lp approximations

This page was built for publication: A least distance algorithm for a smooth strictly convex norm