Momentum-based accelerated algorithm for distributed optimization under sector-bound nonlinearity

DOI10.1016/J.JFRANKLIN.2025.107857MaRDI QIDQ6936896zbMATH OpenFDO

Authors Hamid R. Rabiee

Publication date 28 August 2025

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JFRANKLIN.2025.107857

zbMATH Keywords

consensusdistributed optimizationheavy-ball methodsector-bound nonlinearity

Mathematics Subject Classification ID

Stability of solutions to ordinary differential equations (34D20) Deterministic network models in operations research (90B10) Nonconvex programming, global optimization (90C26)

Cites work

• A Logarithmic Quantization Index Modulation for Perceptually Better Data Hiding
• A resilient distributed optimization algorithm based on consensus of multi-agent system against two attack scenarios
• ADD-OPT: Accelerated Distributed Directed Optimization
• Average consensus on general strongly connected digraphs
• Average Consensus with Packet Drop Communication
• Communication-efficient design for quantized decentralized federated learning
• Consensus and Cooperation in Networked Multi-Agent Systems
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
• Distributed Optimization Over Time-Varying Directed Graphs
• Distributed Signal Processing and Optimization Based on In-Network Subspace Projections
• Distributed Stochastic Consensus Optimization With Momentum for Nonconvex Nonsmooth Problems
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 53595 (Why is no real title available?)
• Quantization avoids saddle points in distributed optimization
• Quantization Design for Distributed Optimization
• Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
• Robust fixed-time distributed optimization with predefined convergence-time bound
• Secure distributed optimization under gradient attacks
• Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs

Cited in

(2)

• Distributed optimal coordination for Euler-Lagrange systems with input dead-zone
• Distributed allocation and resource scheduling algorithms resilient to link failure

This page was built for publication: Momentum-based accelerated algorithm for distributed optimization under sector-bound nonlinearity

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