Dualize, Split, Randomize: Fast Nonsmooth Optimization Algorithms

By Adil Salim, Laurent Condat, Konstantin Mishchenko, Peter Richtárik. 2020

20 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Ahmed Khaled
2. Grigory Malinovsky
3. Peter Richtárik
4. Dmitry Kovalev
5. S. Chraibi
6. Laurent Condat
7. Adil Salim
8. Nicolas Loizou

Citations in the corpus

• Distributed Fixed Point Methods with Compressed Iterates (2019, methodology): “Moreover, this map satisfies Assumption 1 with B = 0 if F is strongly convex and H the function equal to + ∞ everywhere except at one point b , see [39].”
• Distributed Proximal Splitting Algorithms with Rates and Acceleration (2020, methodology): “On the other hand, if we exchange the roles of the two functions H̃ and R̃, we obtain a different algorithm: it is a nonstationary version of the PDDY algorithm proposed recently [22].”