Differentially private and communication-efficient distributed nonconvex optimization algorithms

DOI10.1016/J.AUTOMATICA.2025.112338MaRDI QIDQ6980020zbMATH OpenFDO

Authors Antai Xie, Xinlei Yi, Xiaofan Wang, Ming Cao, Xiaoqiang Ren

Publication date 23 May 2025

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2025.112338

zbMATH Keywords

compression communicationdifferential privacydistributed nonconvex optimizationlinear convergence

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites work

• A Compressed Gradient Tracking Method for Decentralized Optimization With Linear Convergence
• A Distributed Algorithm for Resource Allocation Over Dynamic Digraphs
• A Distributed Newton Method for Network Utility Maximization–I: Algorithm
• A system-theoretic framework for privacy preservation in continuous-time multiagent dynamics
• An Exact Quantized Decentralized Gradient Descent Algorithm
• Communication Compression for Distributed Nonconvex Optimization
• Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
• Decentralized Frank–Wolfe Algorithm for Convex and Nonconvex Problems
• Differential privacy in distributed optimization with gradient tracking
• Differential Privacy: A Survey of Results
• Differentially Private Distributed Optimization via State and Direction Perturbation in Multiagent Systems
• Diffusion LMS Strategies for Distributed Estimation
• Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
• Distributed Subgradient Methods for Multi-Agent Optimization
• EXTRA: an exact first-order algorithm for decentralized consensus optimization
• Harnessing Smoothness to Accelerate Distributed Optimization
• Linear Convergence of Consensus-Based Quantized Optimization for Smooth and Strongly Convex Cost Functions
• Linear convergence of first order methods for non-strongly convex optimization
• Linear Convergence of First- and Zeroth-Order Primal–Dual Algorithms for Distributed Nonconvex Optimization
• Newton-Raphson Consensus for Distributed Convex Optimization
• On Nonconvex Decentralized Gradient Descent
• On the convergence of decentralized gradient descent
• Optimization methods for large-scale machine learning
• Penalized likelihood regression for generalized linear models with non-quadratic penalties
• Preserving Data-Privacy With Added Noises: Optimal Estimation and Privacy Analysis
• Privacy Preserving Average Consensus
• Privacy preserving distributed optimization using homomorphic encryption
• Privacy-Preserving Average Consensus via State Decomposition
• Quantization Enabled Privacy Protection in Decentralized Stochastic Optimization
• Quantized Distributed Gradient Tracking Algorithm With Linear Convergence in Directed Networks

Cited in

(1)

• Escaping saddle points in distributed nonconvex optimization via cubic regularization

This page was built for publication: Differentially private and communication-efficient distributed nonconvex optimization algorithms

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