Optimal selections of stepsizes and blocks for the block-iterative ART

DOI10.1080/00036811.2019.1607314MaRDI QIDQ5148321zbMATH OpenOpenAlexWikidataFDO

Authors Songnian He, Lili Liu, Hong-Kun Xu

Publication date 3 February 2021

Published in Applicable Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00036811.2019.1607314

zbMATH Keywords

projectionsystem of linear equationsrandom selectionoptimal step sizeoptimal blocksblock-iterative ART

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Methods of reduced gradient type (90C52)

Cites work

• scientific article; zbMATH DE number 3853749 (Why is no real title available?)
• scientific article; zbMATH DE number 6252408 (Why is no real title available?)
• Block-iterative algorithms
• Bounds on the largest singular value of a matrix and the convergence of simultaneous and block‐iterative algorithms for sparse linear systems
• Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
• Projection method for solving a singular system of linear equations and its applications
• Realization of the hybrid method for Mann iterations
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Selective projection methods for solving a class of variational inequalities
• The selective projection method for convex feasibility and split feasibility problems

This page was built for publication: Optimal selections of stepsizes and blocks for the block-iterative ART

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