# First-order primal-dual methods for nonsmooth nonconvex optimisation

arXiv: https://arxiv.org/abs/1910.00115 · HTML: https://mlsanity.com/paper/1910.00115/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Sep 2019.

## Built on by (most cited first, 2 of 2)

- [Prediction techniques for dynamic imaging with online primal-dual methods](https://mlsanity.com/paper/2405.02497/) (2024)
- [Proximal methods for point source localisation](https://mlsanity.com/paper/2212.02991/) (2022)

## 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.