Constrained randomized Gauss-Seidel methods for nonnegative least-squares problem

DOI10.12286/JSSX.J2024-1249MaRDI QIDQ6916460zbMATH OpenFDO

Authors Xiaoling Li, Wei Wei, Tao Shi

Publication date 15 October 2025

Published in Mathematica Numerica Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12286/JSSX.J2024-1249

zbMATH Keywords

Gauss-Seidel methodsgreedy criterionleast-squaresnonnegative constraintsrandom sampling

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Cites work

• A randomized Kaczmarz algorithm with exponential convergence
• AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
• AIR tools II: algebraic iterative reconstruction methods, improved implementation
• An active set truncated Newton method for large-scale bound constrained optimization
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• Angenäherte Auflösung von Systemen linearer Gleichungen.
• Constrained Kaczmarz extended algorithm for image reconstruction
• Constrained SART algorithm for inverse problems in image reconstruction
• Convex programming in Hilbert space
• Coordinate descent algorithms
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• Learning a Nonnegative Sparse Graph for Linear Regression
• Learning the parts of objects by non-negative matrix factorization
• On convergence rates of Kaczmarz-type methods with different selection rules of working rows
• On greedy randomized coordinate descent methods for solving large linear least-squares problems.
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On randomized sampling Kaczmarz method with application in compressed sensing
• On the Goldstein-Levitin-Polyak gradient projection method
• Projected gradient methods for linearly constrained problems
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Projected randomized Kaczmarz methods
• Randomized extended Kaczmarz for solving least squares
• Randomized methods for linear constraints: convergence rates and conditioning
• Sparse sampling Kaczmarz–Motzkin method with linear convergence
• The University of Florida sparse matrix collection

This page was built for publication: Constrained randomized Gauss-Seidel methods for nonnegative least-squares problem

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