Distributed Discrete-Time Convex Optimization With Closed Convex Set Constraints: Linearly Convergent Algorithm Design

The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed optimization algorithms. In this article, a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization pr...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on cybernetics Vol. 54; no. 4; pp. 2271 - 2283
Main Authors:	Luan, Meng, Wen, Guanghui, Liu, Hongzhe, Huang, Tingwen, Chen, Guanrong, Yu, Wenwu
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.04.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Computational geometry Consensus Consensus algorithm Convergence Convex functions Convexity directed interaction topology distributed constrained optimization Eigenvalues and eigenfunctions gradient tracking Graph theory Graphs linear convergence rate Momentum Network topology Numerical simulation Optimization Topology
ISSN:	2168-2267, 2168-2275, 2168-2275
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!