First-order primal-dual methods for nonsmooth nonconvex optimisation
Not on the map. Why?
Abstract (arXiv)
We provide an overview of primal-dual algorithms for nonsmooth and non-convex-concave saddle-point problems. This flows around a new analysis of such methods, using Bregman divergences to formulate simplified conditions for convergence.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1.
2 papers.