Stochastic block projection algorithms with extrapolation for convex feasibility problems
From MaRDI portal
Publication:5058397
DOI10.1080/10556788.2021.1998492OpenAlexW4213323278MaRDI QIDQ5058397FDOQ5058397
Authors: Ion Necoara 
Publication date: 20 December 2022
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.1998492
Recommendations
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
- Extrapolation algorithm for affine-convex feasibility problems
- Iterative methods of solving stochastic convex feasibility problems and applications
- Block-iterative subgradient projection algorithms for the convex feasibility problem
Cites Work
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Conic optimization via operator splitting and homogeneous self-dual embedding
- On Projection Algorithms for Solving Convex Feasibility Problems
- Randomized methods for linear constraints: convergence rates and conditioning
- The method of projections for finding the common point of convex sets
- The Relaxation Method for Linear Inequalities
- Title not available (Why is that?)
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Functional Operators (AM-21), Volume 1
- Convergence of stochastic proximal gradient algorithm
- Hilbertian convex feasibility problem: Convergence of projection methods
- Decomposition through formalization in a product space
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Averaging strings of sequential iterations for convex feasibility problems.
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Extrapolation algorithm for affine-convex feasibility problems
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- Energy-based sensor network source localization via projection onto convex sets
- Linear convergence of first order methods for non-strongly convex optimization
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
- Faster Randomized Block Kaczmarz Algorithms
- A log-quadratic projection method for convex feasibility problems
Cited In (4)
- On adaptive stochastic heavy ball momentum for solving linear systems
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes
Uses Software
This page was built for publication: Stochastic block projection algorithms with extrapolation for convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058397)
