Gradient-free push-sum method for strongly convex distributed optimization

DOI10.11721/CQNUJ20190102MaRDI QIDQ5209422zbMATH OpenFDO

Authors Shu-Hui Yu, Jueyou Li, Xuewu Du

Publication date 22 January 2020

zbMATH Keywords

distributed convex optimizationmulti-agent systempush-sum protocolgradient-free algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Agent technology and artificial intelligence (68T42) Distributed algorithms (68W15)

Recommendations

• Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
• Strong consistency of random gradient-free algorithms for distributed optimization
• Gradient-free distributed optimization with exact convergence
• Gradient-free method for nonsmooth distributed optimization
• Distributed consensus-based multi-agent convex optimization via gradient tracking technique

Cited in

(8)

• Asynchronous gossip-based gradient-free method for multiagent optimization
• Push–Pull Gradient Methods for Distributed Optimization in Networks
• Distributed line search for multiagent convex optimization
• Gradient-free method for nonsmooth distributed optimization
• A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
• Strong consistency of random gradient-free algorithms for distributed optimization
• Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
• Gradient-free distributed optimization with exact convergence

This page was built for publication: Gradient-free push-sum method for strongly convex distributed optimization

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