Distributed forward-backward methods for ring networks

DOI10.1007/S10589-022-00400-ZarXiv2112.00274WikidataQ113904026 ScholiaQ113904026MaRDI QIDQ6146367FDOQ6146367

Authors: Francisco J. Aragón Artacho, Yura Malitsky, Matthew K. Tam, David Torregrosa-Belén 

Publication date: 10 January 2024

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Abstract: In this work, we propose and analyse forward-backward-type algorithms for finding a zero of the sum of finitely many monotone operators, which are not based on reduction to a two operator inclusion in the product space. Each iteration of the studied algorithms requires one resolvent evaluation per set-valued operator, one forward evaluation per cocoercive operator, and two forward evaluations per monotone operator. Unlike existing methods, the structure of the proposed algorithms are suitable for distributed, decentralised implementation in ring networks without needing global summation to enforce consensus between nodes.

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

Recommendations

• A forward-backward splitting method for monotone inclusions without cocoercivity
• Resolvent splitting for sums of monotone operators with minimal lifting
• Extended forward-backward algorithm
• An inertial forward-backward algorithm for monotone inclusions
• Shadow Douglas-Rachford splitting for monotone inclusions

zbMATH Keywords

forward-backward algorithmsplitting algorithmmonotone inclusionmonotone operatordistributed optimisation

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Monotone operators and generalizations (47H05)

Cites Work

• Projective splitting with forward steps only requires continuity
• Monotone (nonlinear) operators in Hilbert space
• Title not available (Why is that?)
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• EXTRA: an exact first-order algorithm for decentralized consensus optimization
• Title not available (Why is that?)
• A forward-backward splitting method for monotone inclusions without cocoercivity
• Convex analysis and monotone operator theory in Hilbert spaces
• A generalized forward-backward splitting
• A three-operator splitting scheme and its optimization applications
• Title not available (Why is that?)
• A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting
• Backward-forward-reflected-backward splitting for three operator monotone inclusions
• Shadow Douglas-Rachford splitting for monotone inclusions
• Resolvent splitting for sums of monotone operators with minimal lifting
• An adaptive splitting algorithm for the sum of two generalized monotone operators and one cocoercive operator
• Single-forward-step projective splitting: exploiting cocoercivity
• Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
• A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes
• The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection

Cited In (3)

• Regularity of sets under a reformulation in a product space with reduced dimension
• In memoriam: Asen L. Dontchev (1948--2021)
• Convergence analysis of a new forward-reflected-backward algorithm for four operators without cocoercivity

This page was built for publication: Distributed forward-backward methods for ring networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146367)