Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems
From MaRDI portal
Publication:2827061
DOI10.1137/141002220zbMath1348.65069OpenAlexW2523528550MaRDI QIDQ2827061
Ning Zheng, Jun-Feng Yin, Ken Hayami
Publication date: 12 October 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c7e0e9aac376eeb613e27c67b8a81d08cb19768a
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Related Items
A class of new modulus-based matrix splitting methods for linear complementarity problem, On the convergence of modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problems with \(H_+\)-matrices, Modulus Methods for Nonnegatively Constrained Image Restoration, Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems, Modulus-based matrix splitting algorithms for the quasi-complementarity problems, A class of preconditioners based on positive-definite operator splitting iteration methods for variable-coefficient space-fractional diffusion equations, A modulus iteration method for non-negatively constrained TV image restoration, A class of modulus-based matrix splitting methods for vertical linear complementarity problem, The relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems of positive definite matrices, On the new modulus-based matrix splitting method for linear complementarity problem of \(H_+\)-matrix, Secant variable projection method for solving nonnegative separable least squares problems, Modulus-based iterative methods for constrained ℓ p – ℓ q minimization, Column-oriented algebraic iterative methods for nonnegative constrained least squares problems, A Modulus Iteration Method for SPSD Linear Complementarity Problem Arising in Image Retinex, Modulus-based iterative methods for constrained Tikhonov regularization, A modulus-based multigrid method for image retinex, Newton-based matrix splitting method for generalized absolute value equation, Linearized Krylov subspace Bregman iteration with nonnegativity constraint, On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices, A class of upper and lower triangular splitting iteration methods for image restoration, A modulus-based iterative method for sparse signal recovery, Fast modulus-based matrix splitting iteration methods for implicit complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
- A hybrid multilevel-active set method for large box-constrained linear discrete ill-posed problems
- On iterative algorithms for linear least squares problems with bound constraints
- Solving the minimal least squares problem subject to bounds on the variables
- Quadratic programs in frictionless contact problems
- Algorithms for bound constrained quadratic programming problems
- Implementing proximal point methods for linear programming
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- A class of methods for solving large, convex quadratic programs subject to box constraints
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- An iterative two-step algorithm for linear complementarity problems
- Quasi-Newton approach to nonnegative image restorations
- An iterative method for linear discrete ill-posed problems with box constraints
- The university of Florida sparse matrix collection
- GMRES Methods for Least Squares Problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- Projected gradient methods for linearly constrained problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the Goldstein-Levitin-Polyak gradient projection method
- A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Iterative Solution of Nonlinear Equations in Several Variables
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The conjugate gradient method in extremal problems
- Non-negativity and iterative methods for ill-posed problems
