Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping

DOI10.1137/140971233zbMath1317.65135arXiv1404.7536OpenAlexW1493782845MaRDI QIDQ5501199

Patrick L. Combettes, Jean-Christophe Pesquet

Publication date: 3 August 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.7536

zbMATH Keywords

primal-dual algorithmstochastic algorithmarbitrary samplingfixed-point algorithmblock-coordinate algorithmmonotone operator splittingstochastic quasi-Fejér sequencestructured convex minimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates ⋮ Almost sure convergence of the forward-backward-forward splitting algorithm ⋮ Convergence properties of a randomized primal-dual algorithm with applications to parallel MRI ⋮ On the Douglas-Rachford algorithm ⋮ A fully stochastic primal-dual algorithm ⋮ Randomized progressive hedging methods for multi-stage stochastic programming ⋮ Stochastic forward-backward splitting for monotone inclusions ⋮ 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 ⋮ Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays ⋮ Unnamed Item ⋮ Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators ⋮ On the Convergence of Stochastic Primal-Dual Hybrid Gradient ⋮ Decentralized proximal splitting algorithms for composite constrained convex optimization ⋮ On unbounded delays in asynchronous parallel fixed-point algorithms ⋮ Minibatch Forward-Backward-Forward Methods for Solving Stochastic Variational Inequalities ⋮ Perspective functions: proximal calculus and applications in high-dimensional statistics ⋮ 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 ⋮ Affine nonexpansive operators, Attouch-Théra duality and the Douglas-Rachford algorithm ⋮ A decomposition method for solving multicommodity network equilibria ⋮ Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions ⋮ Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods ⋮ Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications ⋮ Zeroth-order optimization with orthogonal random directions ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression ⋮ Learning with optimal interpolation norms ⋮ Evolution of Mixed Strategies in Monotone Games ⋮ Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods ⋮ On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games ⋮ Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency ⋮ Stochastic projective splitting ⋮ Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory ⋮ Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization ⋮ Stochastic Fixed-Point Iterations for Nonexpansive Maps: Convergence and Error Bounds ⋮ Variance reduction for root-finding problems ⋮ A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity ⋮ Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences ⋮ A survey on operator splitting and decomposition of convex programs ⋮ 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 ⋮ Two stochastic optimization algorithms for convex optimization with fixed point constraints ⋮ Forward-reflected-backward method with variance reduction ⋮ Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence ⋮ A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions ⋮ Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization ⋮ An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games ⋮ Convergence of stochastic proximal gradient algorithm ⋮ Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications ⋮ A block coordinate variable metric forward-backward algorithm ⋮ Modified Fejér sequences and applications ⋮ Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs ⋮ Perspective maximum likelihood-type estimation via proximal decomposition ⋮ Bayesian computation: a summary of the current state, and samples backwards and forwards ⋮ Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization ⋮ A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions ⋮ ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates ⋮ Random activations in primal-dual splittings for monotone inclusions with a priori information ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ A randomized incremental primal-dual method for decentralized consensus optimization ⋮ Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces ⋮ Stochastic proximal-gradient algorithms for penalized mixed models ⋮ Convergence analysis of the stochastic reflected forward-backward splitting algorithm ⋮ A generic coordinate descent solver for non-smooth convex optimisation ⋮ Proximal Gradient Methods for Machine Learning and Imaging

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Iterative methods for fixed point problems in Hilbert spaces
• A Douglas-Rachford splitting method for solving equilibrium problems
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
• A primal-dual method of partial inverses for composite inclusions
• On the complexity analysis of randomized block-coordinate descent methods
• Dualization of signal recovery problems
• A block coordinate variable metric forward-backward algorithm
• Fejér processes in theory and practice: recent results
• Lectures on topics in finite element solution of elliptic problems. Notes by G. Vijayasundaram
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• An alternating projection that does not converge in norm
• A splitting algorithm for dual monotone inclusions involving cocoercive operators
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
• A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• A splitting method for stochastic programs
• Construction of fixed points of demicompact mappings in Hilbert space
• Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
• Proximal point algorithm, Douglas-Rachford algorithm and alternating projections: a case study
• Accelerated and Inexact Forward-Backward Algorithms
• A Generalized Forward-Backward Splitting
• Optimal Transport with Proximal Splitting
• Proximal Splitting Methods in Signal Processing
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• A Parallel Splitting Method for Coupled Monotone Inclusions
• Characterizing arbitrarily slow convergence in the method of alternating projections
• Convex Variational Formulation with Smooth Coupling for Multicomponent Signal Decomposition and Recovery
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• On Projection Algorithms for Solving Convex Feasibility Problems
• Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
• Hilbert-Valued Perturbed Subgradient Algorithms
• Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
• A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
• Signal Recovery by Proximal Forward-Backward Splitting
• Variable metric forward–backward splitting with applications to monotone inclusions in duality
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Monotone Operator Methods for Nash Equilibria in Non-potential Games
• On Integration in Vector Spaces
• Convex analysis and monotone operator theory in Hilbert spaces