Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
From MaRDI portal
(Redirected from Publication:5501199)
Abstract: This work proposes block-coordinate fixed point algorithms with applications to nonlinear analysis and optimization in Hilbert spaces. The asymptotic analysis relies on a notion of stochastic quasi-Fej'er monotonicity, which is thoroughly investigated. The iterative methods under consideration feature random sweeping rules to select arbitrarily the blocks of variables that are activated over the course of the iterations and they allow for stochastic errors in the evaluation of the operators. Algorithms using quasinonexpansive operators or compositions of averaged nonexpansive operators are constructed, and weak and strong convergence results are established for the sequences they generate. As a by-product, novel block-coordinate operator splitting methods are obtained for solving structured monotone inclusion and convex minimization problems. In particular, the proposed framework leads to random block-coordinate versions of the Douglas-Rachford and forward-backward algorithms and of some of their variants. In the standard case of block, our results remain new as they incorporate stochastic perturbations.
Recommendations
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
- Stochastic forward Douglas-Rachford splitting method for monotone inclusions
- Stochastic approximations and perturbations in forward-backward splitting for monotone operators
- Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
Cites work
- A block coordinate variable metric forward-backward algorithm
- A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- A Douglas-Rachford splitting method for solving equilibrium problems
- A generalized forward-backward splitting
- A parallel inertial proximal optimization method
- A parallel splitting method for coupled monotone inclusions
- A primal-dual method of partial inverses for composite inclusions
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A splitting method for stochastic programs
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Accelerated and inexact forward-backward algorithms
- An alternating projection that does not converge in norm
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Construction of fixed points of demicompact mappings in Hilbert space
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery
- Dualization of signal recovery problems
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Fejér processes in theory and practice: recent results
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Hilbert-Valued Perturbed Subgradient Algorithms
- scientific article; zbMATH DE number 3933857 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 3599198 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 761717 (Why is no real title available?)
- scientific article; zbMATH DE number 3269391 (Why is no real title available?)
- scientific article; zbMATH DE number 3334605 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- scientific article; zbMATH DE number 6252408 (Why is no real title available?)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Iterative construction of the resolvent of a sum of maximal monotone operators
- Iterative methods for fixed point problems in Hilbert spaces
- Lectures on topics in finite element solution of elliptic problems. Notes by G. Vijayasundaram
- Monotone Operator Methods for Nash Equilibria in Non-potential Games
- Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
- On Integration in Vector Spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the complexity analysis of randomized block-coordinate descent methods
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Optimal transport with proximal splitting
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
- Proximal splitting methods in signal processing
- Quasi-Fejérian analysis of some optimization algorithms
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
Cited in
(89)- On unbounded delays in asynchronous parallel fixed-point algorithms
- Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm
- Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
- Modified Fejér sequences and applications
- An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games
- Convergence of stochastic proximal gradient algorithm
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Random activations in primal-dual splittings for monotone inclusions with a priori information
- Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces
- Convergence analysis of the stochastic reflected forward-backward splitting algorithm
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- Forward-reflected-backward method with variance reduction
- Perspective maximum likelihood-type estimation via proximal decomposition
- Stochastic proximal-gradient algorithms for penalized mixed models
- On the Douglas-Rachford algorithm
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Perspective functions: proximal calculus and applications in high-dimensional statistics
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- Learning with optimal interpolation norms
- Two fast variance-reduced proximal gradient algorithms for SMVIPs -- stochastic mixed variational inequality problems with suitable applications to stochastic network games and traffic assignment problems
- A decomposition method for solving multicommodity network equilibria
- Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods
- Variance reduction for root-finding problems
- Almost sure convergence of the forward-backward-forward splitting algorithm
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- Stochastic forward-backward splitting for monotone inclusions
- A survey on operator splitting and decomposition of convex programs
- Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods
- Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
- An incremental mirror descent subgradient algorithm with random sweeping and proximal step
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- scientific article; zbMATH DE number 7079312 (Why is no real title available?)
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- A randomized incremental primal-dual method for decentralized consensus optimization
- Proximal Gradient Methods for Machine Learning and Imaging
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- On the convergence of stochastic primal-dual hybrid gradient
- Minibatch forward-backward-forward methods for solving stochastic variational inequalities
- On synchronous, asynchronous, and randomized best-response schemes for stochastic Nash games
- Stochastic reformulations of linear systems: algorithms and convergence theory
- A forward-backward splitting method for monotone inclusions without cocoercivity
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- A generic coordinate descent solver for non-smooth convex optimisation
- A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- Zeroth-order optimization with orthogonal random directions
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Evolution of Mixed Strategies in Monotone Games
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Stochastic projective splitting
- Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
- Stochastic Fixed-Point Iterations for Nonexpansive Maps: Convergence and Error Bounds
- Inexact and stochastic generalized conditional gradient with augmented Lagrangian and proximal step
- Stochastic primal-dual hybrid gradient algorithm with adaptive step sizes
- The geometry of monotone operator splitting methods
- A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
- Computing Wasserstein barycenters via operator splitting: the method of averaged marginals
- Distributed Ishikawa algorithms for seeking the fixed points of multi-agent global operators over time-varying communication graphs
- A quantitative Robbins-Siegmund theorem
- Sequential sample average majorization-minimization
- Almost-surely convergent randomly activated monotone operator splitting methods
- A stochastic primal-dual splitting algorithm with variance reduction for composite optimization problems
- Inertial stochastic reflected forward backward method with applications to traffic network problems
- A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems
- On quantitative convergence for stochastic processes: crossings, fluctuations and martingales
- Convergence in distribution of randomized algorithms: the case of partially separable optimization
- A Distributed Block-Split Gibbs Sampler with Hypergraph Structure for High-Dimensional Inverse Problems
- Randomized primal-dual algorithm with arbitrary sampling: convergence theory and applications to parallel MRI
- Randomized block coordinate descent method for linear ill-posed problems
- Coordinate-update algorithms can efficiently detect infeasible optimization problems
- Krasnoselskii-Mann iterations: inertia, perturbations and approximation
- A block coordinate variable metric forward-backward algorithm
- Stochastic forward-backward-half forward splitting algorithm with variance reduction
- Adaptive step-size extragradient algorithm with variance reduction for solving mixed variational inequality problems
- A normal map-based proximal stochastic gradient method: convergence and identification properties
- The variance reduced Douglas-Rachford splitting method for large-scale optimization problems
- Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI
- A fully stochastic primal-dual algorithm
- Randomized progressive hedging methods for multi-stage stochastic programming
This page was built for publication: Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501199)