Delay-tolerant distributed Bregman proximal algorithms

DOI10.1080/10556788.2023.2278089MaRDI QIDQ6907527zbMATH OpenFDO

Authors S. Chraibi, Franck Iutzeler, Jérôme Malick, Alexander Rogozin

Publication date 1 November 2025

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2023.2278089

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites work

• A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
• A distributed flexible delay-tolerant proximal gradient algorithm
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Convex analysis and monotone operator theory in Hilbert spaces
• First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
• First-order methods in optimization
• Global convergence rate of proximal incremental aggregated gradient methods
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 1046019 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• Image deblurring with Poisson data: from cells to galaxies
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Julia: a fresh approach to numerical computing
• On unbounded delays in asynchronous parallel fixed-point algorithms
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems

This page was built for publication: Delay-tolerant distributed Bregman proximal algorithms

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