Primal-dual proximal algorithms for structured convex optimization: a unifying framework

DOI10.1007/978-3-319-97478-1_5zbMath1423.90183OpenAlexW2899571732MaRDI QIDQ2415201

Panagiotis Patrinos, Puya Latafat

Publication date: 21 May 2019

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/629554

zbMATH Keywords

convex optimizationoperator splittinglinear convergenceprimal-dual algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods involving duality (49M29) Optimality conditions and duality in mathematical programming (90C46) Monotone operators and generalizations (47H05)

Related Items (5)

On the Convergence of Stochastic Primal-Dual Hybrid Gradient ⋮ Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods ⋮ A generalized forward-backward splitting operator: degenerate analysis and applications ⋮ Nonlinear Forward-Backward Splitting with Projection Correction ⋮ Shadow Douglas-Rachford splitting for monotone inclusions

This page was built for publication: Primal-dual proximal algorithms for structured convex optimization: a unifying framework