Order-reducing conjugate gradients versus block AOR for constrained least-squares problems

DOI10.1016/0024-3795(91)90371-3MaRDI QIDQ808173zbMATH OpenOpenAlexFDO

Authors Douglas James

Publication date 1991

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(91)90371-3

zbMATH Keywords

convergenceiterative methodsconjugate gradient algorithmsuccessive overrelaxationNumerical experimentsleast-squares problemsblock accelerated overrelaxation

Mathematics Subject Classification ID

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

Recommendations

• Block conjugate gradient algorithms for least squares problems
• Block AOR Iterative Schemes for Large-Scale Least-Squares Problems
• Retooling the method of block conjugate gradients
• scientific article; zbMATH DE number 279601
• Publication:4935919
• A block-coordinate descent method for linearly constrained minimization problem
• On the convergence of inexact block coordinate descent methods for constrained optimization
• scientific article; zbMATH DE number 31273
• Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
• An affine scaling reduced preconditional conjugate gradient path method for linear constrained optimization

Cites work

• scientific article; zbMATH DE number 4002053 (Why is no real title available?)
• scientific article; zbMATH DE number 3748409 (Why is no real title available?)
• scientific article; zbMATH DE number 3284093 (Why is no real title available?)
• A Framework for Equilibrium Equations
• A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis
• A note on two block-SOR methods for sparse least squares problems
• Accelerated Overrelaxation Method
• An algorithm to compute a sparse basis of the null space
• An iterative substructuring algorithm for equilibrium equations
• Block AOR Iterative Schemes for Large-Scale Least-Squares Problems
• Convergence of a direct-iterative method for large-scale least-squares problems
• Implicit Nullspace Iterative Methods for Constrained Least Squares Problems
• Iterative Methods for Equality-Constrained Least Squares Problems
• Iterative Methods for Solving Partial Difference Equations of Elliptic Type
• Optimal successive overrelaxation iterative methods for \(p\)-cyclic matrices
• Optimality relationships for p-cyclic SOR
• Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
• p-cyclic matrices: A generalization of the Young-Frankel successive overrelaxation scheme

Cited in

(4)

• An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
• Numerical methods for generalized least squares problems
• An iterative substructuring algorithm for equilibrium equations
• Iterative Methods for Equality-Constrained Least Squares Problems

Describes a project that uses

Uses Software

• LINPACK

This page was built for publication: Order-reducing conjugate gradients versus block AOR for constrained least-squares problems

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