A Computation-Efficient Decentralized Algorithm for Composite Constrained Optimization

This paper focuses on solving the problem of composite constrained convex optimization with a sum of smooth convex functions and non-smooth regularization terms (ℓ 1 norm) subject to locally general constraints. Motivated by the modern large-scale information processing problems in machine learning...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on signal and information processing over networks Ročník 6; s. 774 - 789
Hlavní autori:	Lu, Qingguo, Liao, Xiaofeng, Li, Huaqing, Huang, Tingwen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Composite constrained optimization computation-efficient Computational efficiency Computational geometry Constituents Constraints Convergence Convex analysis Convex functions Convexity Data processing decentralized stochastic algorithm differential privacy Gradient methods Information processing Linear programming Machine learning Optimization Privacy Regularization Task analysis Upper bounds variance reduction
ISSN:	2373-776X, 2373-7778
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!