Distributed Randomized Gradient-Free Convex Optimization With Set Constraints Over Time-Varying Weight-Unbalanced Digraphs

This paper explores a class of distributed constrained convex optimization problems where the objective function is a sum of <inline-formula><tex-math notation="LaTeX">N</tex-math></inline-formula> convex local objective functions. These functions are characterized...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on network science and engineering Vol. 12; no. 2; pp. 610 - 622
Main Authors:	Zhu, Yanan, Li, Qinghai, Li, Tao, Wen, Guanghui
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.03.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Closed box Constraints Convergence Convergence rate Convex analysis Convex functions Convexity Directed graphs distributed multi-agent optimization Graph theory Linear programming Lipschitz condition Optimization Prediction algorithms randomized gradient-free Smoothing methods Smoothness Stochastic processes time-varying weight-unbalanced digraphs Vectors
ISSN:	2327-4697, 2334-329X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!