A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
From MaRDI portal
Publication:2401513
DOI10.1007/s10957-017-1074-7OpenAlexW2587595384MaRDI QIDQ2401513
Publication date: 1 September 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1074-7
Convex programming (90C25) Monotone operators and generalizations (47H05) Parallel numerical computation (65Y05) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (23)
Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators ⋮ Randomized progressive hedging methods for multi-stage stochastic programming ⋮ Multivariate Monotone Inclusions in Saddle Form ⋮ 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 ⋮ 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 ⋮ Stochastic projective splitting ⋮ Unnamed Item ⋮ Comments on: ``A simplified form of block-iterative operator splitting, and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers ⋮ 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 ⋮ A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment ⋮ Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity ⋮ Projective splitting with forward steps only requires continuity ⋮ Convergence Rates for Projective Splitting ⋮ Four-operator splitting via a forward-backward-half-forward algorithm with line search ⋮ Unnamed Item ⋮ On electricity market equilibria with storage: modeling, uniqueness, and a distributed ADMM ⋮ Projective splitting with forward steps
Uses Software
Cites Work
- Unnamed Item
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- A family of projective splitting methods for the sum of two maximal monotone operators
- On Weak Convergence of the Douglas–Rachford Method
- 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”
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
- Solving Coupled Composite Monotone Inclusions by Successive Fejér Approximations of their Kuhn--Tucker Set
- Convex Analysis
This page was built for publication: A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
