Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions

DOI10.1007/s10107-016-1044-0OpenAlexW1512478894MaRDI QIDQ2413104

Patrick L. Combettes, Jonathan Eckstein

Publication date: 6 April 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

dualitymonotone operatorprimal-dual algorithmsplitting algorithmmonotone inclusionasynchronous algorithmblock-iterative algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Monotone operators and generalizations (47H05) Decomposition methods (49M27)

Related Items

A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates, Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators, Projective splitting as a warped proximal algorithm, An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces, Monotone operator theory in convex optimization, A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers, Multivariate Monotone Inclusions in Saddle Form, Perspective functions: proximal calculus and applications in high-dimensional statistics, A decomposition method for solving multicommodity network equilibria, Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods, A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization, A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression, Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions, Nonlinear forward-backward splitting with momentum correction, The multiproximal linearization method for convex composite problems, Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting, On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery, Warped proximal iterations for monotone inclusions, Stochastic projective splitting, Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization, Variance reduction for root-finding problems, Unnamed Item, Unnamed Item, Unnamed Item, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, Analysis and Numerical Solution of a Modular Convex Nash Equilibrium Problem, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, A new splitting method for monotone inclusions of three operators, Nonlinear Forward-Backward Splitting with Projection Correction, Proximal primal-dual best approximation algorithm with memory, Weak convergence of an extended splitting method for monotone inclusions, Single-forward-step projective splitting: exploiting cocoercivity, Perspective maximum likelihood-type estimation via proximal decomposition, Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications, Projective splitting with forward steps only requires continuity, Convergence Rates for Projective Splitting, An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization, Dualize, split, randomize: toward fast nonsmooth optimization algorithms, Four-operator splitting via a forward-backward-half-forward algorithm with line search, Projective splitting with forward steps

Cites Work

• Unnamed Item
• Solving systems of monotone inclusions via primal-dual splitting techniques
• Forward-partial inverse-forward splitting for solving monotone inclusions
• Hilbertian convex feasibility problem: Convergence of projection methods
• A strongly convergent primal-dual method for nonoverlapping domain decomposition
• An LS-free splitting method for composite mappings
• Strong convergence of projection-like methods in Hilbert spaces
• On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
• A family of projective splitting methods for the sum of two maximal monotone operators
• A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
• Best Approximation from the Kuhn-Tucker Set of Composite Monotone Inclusions
• Convergence Rate Analysis of Primal-Dual Splitting Schemes
• A Parallel Splitting Method for Coupled Monotone Inclusions
• A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
• General Projective Splitting Methods for Sums of Maximal Monotone Operators
• A Note on the Paper by Eckstein and Svaiter on “General Projective Splitting Methods for Sums of Maximal Monotone Operators”
• Dualization of Generalized Equations of Maximal Monotone Type
• On Projection Algorithms for Solving Convex Feasibility Problems
• Solving Coupled Composite Monotone Inclusions by Successive Fejér Approximations of their Kuhn--Tucker Set
• Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
• Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Convex analysis and monotone operator theory in Hilbert spaces