Asymptotically optimal row-action methods for generalized least squares problems

DOI10.1080/00207169808804732zbMath0931.65041OpenAlexW2116121478MaRDI QIDQ4256045

Luiz Carlos Matioli, Jin Yun Yuan

Publication date: 14 February 2000

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

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

zbMATH Keywords

sparse matricesgeneralized least squaresnumerical algorithmsrow-iteration methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Cites Work

• Unnamed Item
• On the convergence properties of Hildreth's quadratic programming algorithm
• A simultaneous projections method for linear inequalities
• A relaxed version of Bregman's method for convex programming
• A finitely convergent ``row-action method for the convex feasibility problem
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Convergence of the generalized AOR method
• Preconditioned SOR methods for generalized least-squares problems
• Convergence of the cyclical relaxation method for linear inequalities
• Column Relaxation Methods for Least Norm Problems
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On Regularized Least Norm Problems
• Fast Numerically Stable Computations for Generalized Linear Least Squares Problems
• Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
• On Row Relaxation Methods for Large Constrained Least Squares Problems
• A row relaxation method for large ℓ_p least norm problems