.png){kind=icon}
Return
A Distributed Nesterov-Like Gradient Tracking Algorithm for Composite Constrained Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TSIPN.2023.3239698.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper focuses on the constrained optimization problem where the objective function is composed of smooth (possibly nonconvex) and nonsmooth parts. The proposed algorithm integrates the successive convex approximation (SCA) technique with the gradient tracking mechanism that aims at achieving a linear convergence rate and employing the momentum term to regulate update directions in each time instant. It is proved that the proposed algorithm converges provided that the constant step size and momentum parameter are lower than the given upper bounds. When the smooth part is strongly convex, the proposed algorithm linearly converges to the global optimal solution, whereas it converges to a local stationary solution with a sub-linear convergence rate if the smooth part is nonconvex. Numerical simulations are applied to demonstrate the validity of the proposed algorithm and the theoretical analysis.
Keywords:
Successive convex approximation (SCA)
nonconvex optimization
Nesterov method
gradient tracking
distributed optimization
Journal
IF:
4.9
Papers:
738
Citations:
1.9K
Organization
View more organizations
Cited Papers
Observations on the Optical Deportment of the Atmosphere in Reference to the Phenomena of Putrefaction and Infection.png)
BMJ
OAAI
BMJIF0
OAAIShareSaveShareSaveShareSaveShareSaveImpaired B Cell Development and Proliferation in Absence of Phosphoinositide 3-Kinase p85αScience
ScienceIF0
PREAI
ShareSaveShareSave View more