Column Relaxation Methods for Least Norm Problems

DOI10.1137/0911056zbMATH Open0708.65040OpenAlexW2043246152MaRDI QIDQ3490852FDOQ3490852

Authors: Achiya Dax, Brian Berkowitz 

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0911056

Recommendations

• A row relaxation method for large ℓ_p least norm problems
• scientific article; zbMATH DE number 62436
• scientific article; zbMATH DE number 869699
• A Globally Convergent Method for $l_p $ Problems
• A row relaxation method for large minimax problems

zbMATH Keywords

numerical examplesiterationcomputational effortleast norm problemcolumn-relaxation method

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Cited In (4)

• A row relaxation method for large minimax problems
• A row relaxation method for large \(l_ 1\) problems
• Asymptotically optimal row-action methods for generalized least squares problems
• Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems

This page was built for publication: Column Relaxation Methods for Least Norm Problems

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