Linear Convergence of First- and Zeroth-Order Primal–Dual Algorithms for Distributed Nonconvex Optimization

DOI10.1109/TAC.2021.3108501MaRDI QIDQ5040095zbMATH OpenFDO

Authors Xinlei Yi, Shengjun Zhang, Tao Yang, Karl Henrik Johansson, Tianyou Chai

Publication date 11 October 2022

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

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

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(10)

• Zeroth-order algorithms for stochastic distributed nonconvex optimization
• Event-triggered primal-dual design with linear convergence for distributed nonstrongly convex optimization
• Linear Convergence of First- and Zeroth-Order Primal-Dual Algorithms for Distributed Nonconvex Optimization
• Gradient tracking for sum-of-nonconvex decentralized optimization
• Differentially private and communication-efficient distributed nonconvex optimization algorithms
• Compressed gradient tracking algorithms for distributed nonconvex optimization
• Linear convergence of event-triggered distributed optimization with metric subregularity condition
• Escaping saddle points in distributed nonconvex optimization via cubic regularization
• A distributed method hybridizing fully symmetric Peaceman-Rachford regularization with sequential quadratic programming for nonconvex-nonsmooth multi-block optimization
• A zeroth-order variance-reduced method for decentralized stochastic non-convex optimization

This page was built for publication: Linear Convergence of First- and Zeroth-Order Primal–Dual Algorithms for Distributed Nonconvex Optimization

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