Forward-backward algorithms devised by graphs
From MaRDI portal
Cites work
- A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes
- A generalized forward-backward splitting
- A three-operator splitting scheme and its optimization applications
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition through formalization in a product space
- Degenerate Preconditioned Proximal Point Algorithms
- Distributed forward-backward methods for ring networks
- Frugal and decentralised resolvent splittings defined by nonexpansive operators
- Frugal Splitting Operators: Representation, Minimal Lifting, and Convergence
- Graph and distributed extensions of the Douglas-Rachford method
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Old and new results on algebraic connectivity of graphs
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Resolvent splitting for sums of monotone operators with minimal lifting
- Solving monotone inclusions involving the sum of three maximally monotone operators and a cocoercive operator with applications
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
Cited in
(2)
This page was built for publication: Forward-backward algorithms devised by graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911541)