The method of randomized Bregman projections for stochastic feasibility problems
DOI10.1007/s11075-022-01468-8OpenAlexW4313457124WikidataQ122781492 ScholiaQ122781492MaRDI QIDQ6156125
Saverio Salzo, Vladimir R. Kostić
Publication date: 12 June 2023
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01468-8
randomized algorithmlinear convergencestochastic convex feasibility problemBregman projection method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Stochastic programming (90C15) Numerical methods based on nonlinear programming (49M37) Numerical analysis (65-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- A randomized Kaczmarz algorithm with exponential convergence
- Bregman distances and Chebyshev sets
- An iterative row-action method for interval convex programming
- Convex analysis and measurable multifunctions
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems
- Iterative methods of solving stochastic convex feasibility problems and applications
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- Convergence of the iterative proportional fitting procedure
- On block Gaussian sketching for the Kaczmarz method
- Generalized self-concordant functions: a recipe for Newton-type methods
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Algorithms for Nonnegative Matrix Factorization with the β-Divergence
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Randomized Iterative Methods for Linear Systems
- Matrix Nearness Problems with Bregman Divergences
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Iterating Bregman Retractions
- Bregman Monotone Optimization Algorithms
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- Stochastic algorithms for exact and approximate feasibility of robust LMIs
- Consensus Driven by the Geometric Mean
- Re-examination of Bregman functions and new properties of their divergences
- Random Function Iterations for Consistent Stochastic Feasibility
- Strong convergence of expected-projection methods in hilbert spaces
- Randomized Kaczmarz Converges Along Small Singular Vectors
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
- On Matrix Nearness Problems: Distance to Delocalization
- Iterative Bregman Projections for Regularized Transportation Problems
- Convex Analysis
- Randomized numerical linear algebra: Foundations and algorithms
- Probability
This page was built for publication: The method of randomized Bregman projections for stochastic feasibility problems
