A Unified Contraction Analysis of a Class of Distributed Algorithms for Composite Optimization
- Award ID(s):
- 1719205
- PAR ID:
- 10128724
- Date Published:
- Journal Name:
- 2019 IEEE 8th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)
- Page Range / eLocation ID:
- 485 to 489
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
In this paper we show that every set A⊂ℕ with positive density contains B+C for some pair B,C of infinite subsets of ℕ, settling a conjecture of Erd\H os. The proof features two different decompositions of an arbitrary bounded sequence into a structured component and a pseudo-random component. Our methods are quite general, allowing us to prove a version of this conjecture for countable amenable groups.more » « less
An official website of the United States government

