Affiliation:
1. Moscow Institute of Physics and Technology
2. Institute for Information Transmission Problems of the RAS (Kharkevich Institute)
3. Caucasian Mathematical Center of the Adyghe State University
Abstract
In this paper, we consider a generalization of the decentralized Frank-Wulff algorithm for network time variables, study the convergence properties of the algorithm, and carry out the corresponding numerical experiments. The changing network is modeled as a deterministic or stochastic sequence of graphs.
Publisher
The Russian Academy of Sciences
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献