A row relaxation method for large ℓp least norm problems

DOI10.1002/NLA.1680010304zbMATH Open0838.65066OpenAlexW1999512663MaRDI QIDQ4868081FDOQ4868081

Authors: Achiya Dax 

Publication date: 3 June 1996

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.1680010304

Recommendations

• scientific article; zbMATH DE number 869699
• A row relaxation method for large \(l_ 1\) problems
• A row relaxation method for large minimax problems

zbMATH Keywords

regularizationnumerical experimentsrelaxation methodKaczmarz's methodleast norm problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cited In (6)

• 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
• Column Relaxation Methods for Least Norm Problems
• Relaxed regularization for linear inverse problems
• Relaxed regularization for linear inverse problems

This page was built for publication: A row relaxation method for large ℓ_p least norm problems

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