On Row Relaxation Methods for Large Constrained Least Squares Problems

DOI10.1137/0914036zbMath0782.65075OpenAlexW2040285835MaRDI QIDQ4693192

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 solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10)

Related Items (7)

Recursive least squares with linear inequality constraints ⋮ Asymptotically optimal row-action methods for generalized least squares problems ⋮ Solution of sparse rectangular systems using LSQR and Craig ⋮ A proximal point algorithm for minimax 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 ⋮ Solving inverse problems using data-driven models ⋮ The adventures of a simple algorithm

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