Column-oriented algebraic iterative methods for nonnegative constrained least squares problems

DOI10.1007/s11075-020-00932-7zbMath1459.65043OpenAlexW3016590824MaRDI QIDQ2225527

Touraj Nikazad, M. Karimpour

Publication date: 8 February 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-020-00932-7

zbMATH Keywords

linear complementarity problemsrelaxation parameterflaggingconstrained linear least squares problemsrow and column-block methods

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Iterative numerical methods for linear systems (65F10) Numerical methods for inverse problems for integral equations (65R32)

Uses Software

• Regularization tools
• AIR tools
• IR Tools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence analysis of a block iterative version of the loping Landweber-Kaczmarz iteration
• Controlling noise error in block iterative methods
• Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
• Convergence analysis for column-action methods in image reconstruction
• Modulus-based iterative methods for constrained Tikhonov regularization
• Semi-convergence and relaxation parameters for a class of SIRT algorithms
• Block-iterative methods for consistent and inconsistent linear equations
• On iterative algorithms for linear least squares problems with bound constraints
• Quadratic programs in frictionless contact problems
• Coordinate descent algorithms
• AIR tools II: algebraic iterative reconstruction methods, improved implementation
• Fundamentals of Computerized Tomography
• Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems
• Reconstruction from a few projections by ℓ ₁ -minimization of the Haar transform
• A modified modulus method for symmetric positive-definite linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems
• Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
• Modulus Methods for Nonnegatively Constrained Image Restoration
• The Linear Complementarity Problem
• Image reconstruction from a small number of projections
• On Diagonally Relaxed Orthogonal Projection Methods
• Properties of a class of block-iterative methods
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
• Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
• Semi-convergence properties of Kaczmarz’s method
• A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
• On the Convergence of Block Coordinate Descent Type Methods
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Fast Nonnegative Least Squares Through Flexible Krylov Subspaces
• Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems

This page was built for publication: Column-oriented algebraic iterative methods for nonnegative constrained least squares problems