Stochastic block projection algorithms with extrapolation for convex feasibility problems
From MaRDI portal
(Redirected from Publication:5058397)
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
- A log-quadratic projection method for convex feasibility problems
- Averaging strings of sequential iterations for convex feasibility problems.
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convergence of stochastic proximal gradient algorithm
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Decomposition through formalization in a product space
- Energy-based sensor network source localization via projection onto convex sets
- Extrapolation algorithm for affine-convex feasibility problems
- Faster randomized block Kaczmarz algorithms
- Functional Operators (AM-21), Volume 1
- Hilbertian convex feasibility problem: Convergence of projection methods
- scientific article; zbMATH DE number 1145160 (Why is no real title available?)
- Improved analysis of the subsampled randomized Hadamard transform
- Linear convergence of first order methods for non-strongly convex optimization
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- Randomized methods for linear constraints: convergence rates and conditioning
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- The method of projections for finding the common point of convex sets
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- The Relaxation Method for Linear Inequalities
Cited in
(8)- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- On adaptive stochastic heavy ball momentum for solving linear systems
- Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
- Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
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)
