Multi-Agent Optimization and Learning: A Non-Expansive Operators Perspective

Abstract

Multi-agent systems are increasingly widespread in a range of application domains, with optimization and learning underpinning many of the tasks that arise in this context. Different approaches have been proposed to enable the cooperative solution of these optimization and learning problems, including first- and second-order methods, and dual (or Lagrangian) methods, all of which rely on consensus and message-passing. In this article we discuss these algorithms through the lens of non-expansive operator theory, providing a unifying perspective. We highlight the insights that this viewpoint delivers, and discuss how it can spark future original research.

References in corpus (7)

• Federated Learning: Challenges, Methods, and Future Directions
• Distributed Pareto Optimization via Diffusion Strategies
• Distributed Optimization for Smart Cyber-Physical Networks
• Asynchronous Distributed Optimization over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence
• Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis
• Coordinate Friendly Structures, Algorithms and Applications
• FedDR -- Randomized Douglas-Rachford Splitting Algorithms for Nonconvex Federated Composite Optimization