Distributed online optimization in time-varying unbalanced networks without explicit subgradients

DOI10.1109/TSP.2022.3194369MaRDI QIDQ6603068zbMATH OpenFDO

Authors Yongyang Xiong, Xiang Li, Keyou You, Ligang Wu

Publication date 12 September 2024

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2022.3194369

Mathematics Subject Classification ID

Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27) Programming involving graphs or networks (90C35) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(5)

• Online convex optimization using coordinate descent algorithms
• Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions
• Online distributed optimization with stochastic gradients: high probability bound of regrets
• Distributed optimization for economic dispatch with acceleration and privacy preservation over unbalanced directed networks
• Online distributed optimization with clipped stochastic gradients: high probability bound of regrets

This page was built for publication: Distributed online optimization in time-varying unbalanced networks without explicit subgradients

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