Author:
Subramanian Shreyas Vathul,DeLaurentis Daniel A.,Sun Dengfeng
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference31 articles.
1. Bertsekas, D.P.: Incremental gradient, subgradient, and proximal methods for convex optimization: a survey. Optim. Mach. Learn. 2010, 1–38 (2011)
2. Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. 129(2), 163–195 (2011)
3. Nedic, A.: Random projection algorithms for convex set intersection problems. In: 2010 49th IEEE Conference on Decision and Control (CDC), pp. 7655–7660. IEEE (2010)
4. Nedic, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 54(1), 48–61 (2009)
5. Rabbat, M.G., Nowak, R.D.: Quantized incremental algorithms for distributed optimization. IEEE J. Sel. Areas Commun. 23(4), 798–808 (2005)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The maximum feasible subset problem (maxFS) and applications;INFOR: Information Systems and Operational Research;2019-06-04