Asymptotically optimal row-action methods for generalized least squares problems
A study of asymptotically optimal behavior of row-iteration methods for solving very large sparse generalized least squares systems of linear equations is given. Row-iteration methods are characterized by the following properties: No changes are made to the original coefficient matrix, no operations are performed on the matrix as a whole, and only one row is used in each iterative step. The authors propose some asymptotically optimal row-iteration methods and several numerical algorithms for the generalized least squares problem. No results of computational experiments are given.
- A finitely convergent ``row-action method for the convex feasibility problem
- A relaxed version of Bregman's method for convex programming
- A row relaxation method for large ℓp least norm problems
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- A simultaneous projections method for linear inequalities
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Column Relaxation Methods for Least Norm Problems
- Convergence of the cyclical relaxation method for linear inequalities
- Convergence of the generalized AOR method
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Fast Numerically Stable Computations for Generalized Linear Least Squares Problems
- scientific article; zbMATH DE number 3631870 (Why is no real title available?)
- On Regularized Least Norm Problems
- On Row Relaxation Methods for Large Constrained Least Squares Problems
- On the convergence properties of Hildreth's quadratic programming algorithm
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Preconditioned SOR methods for generalized least-squares problems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
This page was built for publication: Asymptotically optimal row-action methods for generalized least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256045)