.png){kind=icon}
Return
.png){kind=icon}
.png){kind=icon}
Abstract
En 中文
Dear Editor, This letter aims to investigate the optimization problem where the decision variable is contained in a closed convex set. By combing the gradient decent-like method with the push-sum algorithm framework, we design the distributed iterative formulas under the condition that the considered graphs sequence is time-varying and unbalanced. Under some standard assumptions on the problem setting and the decaying step-sizes, we analyze the convergence property of the generated variables sequence under the proposed iterative formulas.
Keywords:
DISTRIBUTED OPTIMIZATION
DIRECTED-GRAPHS
CONVERGENCE
Journal
I
IF:
19.2
Papers:
1.4K
Citations:
1.1W
Organization
Cited Papers
.png){kind=icon}
Share.png){kind=icon}
Save
ShareSaveShareSaveShort-term strength training improves muscle quality and functional capacity of elderly women.png)
AGE.png)
OAAI
AGEIF0
OAAIShareSaveA Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
PREAI
ShareSave
View more