Asynchronous Optimization Over Graphs: Linear Convergence Under Error Bound Conditions

DOI10.1109/TAC.2020.3033490MaRDI QIDQ5036213zbMATH OpenFDO

Authors Loris Cannelli, Francisco Facchinei, Gesualdo Scutari, Vyacheslav Kungurtsev

Publication date 23 February 2022

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(7)

• Revisiting Asynchronous Linear Solvers
• Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
• On the Divergence of Decentralized Nonconvex Optimization
• Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
• Asynchronous Broadcast-Based Convex Optimization Over a Network
• Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^*
• Asynchronous Optimization over Graphs: Linear Convergence under Error Bound Conditions

This page was built for publication: Asynchronous Optimization Over Graphs: Linear Convergence Under Error Bound Conditions

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