On Row Relaxation Methods for Large Constrained Least Squares Problems

DOI10.1137/0914036MaRDI QIDQ4693192zbMATHOpenAlexFDO

Authors Achiya Dax

Publication date 18 July 1993

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

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

zbMATH Keywords

numerical resultsiterative improvementlarge linearly-constrained least squares problemsrow relaxation methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Cited in

(10)

• Asymptotically optimal row-action methods for generalized least squares problems
• Joint super-resolution image reconstruction and parameter identification in imaging operator: analysis of bilinear operator equations, numerical solution, and application to magnetic particle imaging
• A proximal point algorithm for minimax problems
• The adventures of a simple algorithm
• Solution of sparse rectangular systems using LSQR and Craig
• Recursive least squares with linear inequality constraints
• A class of optimized row projection methods for solving large nonsymmetric linear systems
• Solving inverse problems using data-driven models
• A row relaxation method for large \(l_ 1\) problems
• Dynamic image reconstruction with motion priors in application to three dimensional magnetic particle imaging

This page was built for publication: On Row Relaxation Methods for Large Constrained Least Squares Problems

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