Stochastic block projection algorithms with extrapolation for convex feasibility problems
From MaRDI portal
Publication:5058397
DOI10.1080/10556788.2021.1998492OpenAlexW4213323278MaRDI QIDQ5058397
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.1998492
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Hilbertian convex feasibility problem: Convergence of projection methods
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Convergence of stochastic proximal gradient algorithm
- Linear convergence of first order methods for non-strongly convex optimization
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Extrapolation algorithm for affine-convex feasibility problems
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Decomposition through formalization in a product space
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- Energy-based sensor network source localization via projection onto convex sets
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Faster Randomized Block Kaczmarz Algorithms
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
- The method of projections for finding the common point of convex sets
- Functional Operators (AM-21), Volume 1
- The Relaxation Method for Linear Inequalities
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
This page was built for publication: Stochastic block projection algorithms with extrapolation for convex feasibility problems
