Decentralized Optimization in Networks: Algorithmic Efficiency and Privacy Preservation

Decentralized algorithms are useful for solving large-scale complex optimization problems, which not only alleviate the single-point resource bottleneck problem of centralized algorithms, but also possess higher scalability. Decentralized Optimization in Networks: Algorithmic Efficiency and Privacy Preservation provides the reader with theoretical foundations, practical guidance, and problem-solving approaches to decentralized optimization. It teaches how to apply decentralized optimization algorithms to improve optimization efficiency (communication efficiency, computational efficiency, fast convergence), solve large-scale problems (training for large-scale datasets), achieve privacy preservation (effectively counter external eavesdropping attacks, differential attacks, etc), and overcome a range of challenges in complex decentralized network environments (random sleep, random link failures, time-varying, directed, etc). It focuses on: 1) communication-efficiency: event-triggered communication, random link failures, zeroth-order gradients. 2) computation-efficiency: variance-reduction, Polyak’s projection, stochastic gradient, random sleep. 3) privacy preservation: differential privacy, edge-based correlated perturbations, conditional noises. It uses simulation results, including practical application examples, to illustrate the effectiveness and the practicability of decentralized optimization algorithms. Introduces the latest and advanced algorithms in decentralized optimization of networked control systemsProposes effective strategies for efficient execution and privacy preservation in the development of decentralized optimization algorithmsConstructs the frameworks of convergence and complexity analysis, privacy and security proof, and performance evaluationIncludes systematic detailed implementations on how decentralized optimization algorithms solve the problems in real world systems: smart grid systems, online learning systems, wireless sensor systems, etcHelps reader to develop their own novel decentralized optimization algorithms INDICE: 1. Asynchronous Decentralized Algorithms for Resource Allocation in Directed Networks2. Event-Triggered Decentralized Accelerated Algorithms for Economic Dispatch in Networks3. Variance-Reduced Decentralized Projection Algorithms for Constrained Optimization in Networks4. Event-Triggered Decentralized Gradient Tracking Algorithms for Stochastic Optimization in Networks5. Differentially Private Decentralized Dual Averaging Algorithms for Online Optimization in Directed Networks6. Differentially Private Decentralized Zeroth-Order Algorithms for Online Optimization in Dynamic Networks7. Privacy-Preserving Decentralized Dual Averaging Push Algorithms with Correlated Perturbations8. Privacy-Preserving Decentralized Optimal Economic Dispatch Algorithms with Conditional Noises

• ISBN: 978-0-443-33337-8
• Editorial: Morgan Kaufmann
• Encuadernacion: Rústica
• Páginas: 300
• Fecha Publicación: 01/09/2025
• Nº Volúmenes: 1
• Idioma: Inglés