# Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems

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

## Key facts

- Cited by 25 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Jun 2014.

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

- [Benchopt: Reproducible, efficient and collaborative optimization benchmarks](https://mlsanity.com/paper/2206.13424/) (2022)
- [Learning to Learn Graph Topologies](https://mlsanity.com/paper/2110.09807/) (2021)
- [Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient](https://mlsanity.com/paper/2301.04431/) (2023)
- [Machine Learning for Large-Scale Optimization in 6G Wireless Networks](https://mlsanity.com/paper/2301.03377/) (2023)
- [Physics-informed Score-based Diffusion Model for Limited-angle Reconstruction of Cardiac Computed Tomography](https://mlsanity.com/paper/2405.14770/) (2024)
- [A first-order primal-dual method with adaptivity to local smoothness](https://mlsanity.com/paper/2110.15148/) (2021)
- [Methods for Recovering Conditional Independence Graphs: A Survey](https://mlsanity.com/paper/2211.06829/) (2022)
- [Unfolded proximal neural networks for robust image Gaussian denoising](https://mlsanity.com/paper/2308.03139/) (2023)
- [Two-Stage Stochastic Optimization via Primal-Dual Decomposition and Deep Unrolling](https://mlsanity.com/paper/2105.01853/) (2021)
- [A Stochastic Bregman Primal-Dual Splitting Algorithm for Composite Optimization](https://mlsanity.com/paper/2112.11928/) (2021)
- [Sparse Graphical Linear Dynamical Systems](https://mlsanity.com/paper/2307.03210/) (2023)
- [Federated Learning Using Three-Operator ADMM](https://mlsanity.com/paper/2211.04152/) (2022)
- [Delayed Projection Techniques for Linearly Constrained Problems: Convergence Rates, Acceleration, and Applications](https://mlsanity.com/paper/2101.01505/) (2021)
- [Deep Transform and Metric Learning Networks](https://mlsanity.com/paper/2104.10329/) (2021)
- [Time-varying Graph Learning Under Structured Temporal Priors](https://mlsanity.com/paper/2110.05018/) (2021)
- [Dual NUP Representations and Min-Maximization in Factor Graphs](https://mlsanity.com/paper/2501.12113/) (2025)
- [Scalable Hypergraph Structure Learning with Diverse Smoothness Priors](https://mlsanity.com/paper/2504.03583/) (2025)
- [Learning to Optimize by Differentiable Programming](https://mlsanity.com/paper/2601.16510/) (2026)
- [Metalearning: Sparse Variable-Structure Automata](https://mlsanity.com/paper/2102.00315/) (2021)
- [A Variational Approach for Joint Image Recovery and Feature Extraction Based on Spatially-Varying Generalised Gaussian Models](https://mlsanity.com/paper/2209.01375/) (2022)
- [Graph Filter Transfer via Probability Density Ratio Weighting](https://mlsanity.com/paper/2210.14633/) (2022)
- [Sparse Index Tracking: Simultaneous Asset Selection and Capital Allocation via ℓ0-Constrained Portfolio](https://mlsanity.com/paper/2309.10152/) (2023)
- [Convex Parameter Estimation of Perturbed Multivariate Generalized Gaussian Distributions](https://mlsanity.com/paper/2312.07479/) (2023)
- [Efficient algorithms for regularized Poisson Non-negative Matrix Factorization](https://mlsanity.com/paper/2404.16505/) (2024)
- [Analysis and Synthesis Denoisers for Forward-Backward Plug-and-Play Algorithms](https://mlsanity.com/paper/2411.13276/) (2024)

## Abstract (arXiv)

Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify its solution. Deriving efficient strategies which jointly brings into play the primal and the dual problems is however a more recent idea which has generated many important new contributions in the last years. These novel developments are grounded on recent advances in convex analysis, discrete optimization, parallel processing, and non-smooth optimization with emphasis on sparsity issues. In this paper, we aim at presenting the principles of primal-dual approaches, while giving an overview of numerical methods which have been proposed in different contexts. We show the benefits which can be drawn from primal-dual algorithms both for solving large-scale convex optimization problems and discrete ones, and we provide various application examples to illustrate their usefulness.