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

DOI10.1007/978-3-319-97478-1_5zbMATH Open1423.90183OpenAlexW2899571732MaRDI QIDQ2415201FDOQ2415201

Authors: Puya Latafat, Panagiotis Patrinos 

Publication date: 21 May 2019

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

Recommendations

• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• A primal-dual algorithm framework for convex saddle-point optimization
• A new primal-dual algorithm for structured convex optimization involving a Lipschitzian term
• An implementable first-order primal-dual algorithm for structured convex optimization
• A unified primal-dual algorithm framework based on Bregman iteration

zbMATH Keywords

operator splittingconvex optimizationlinear convergenceprimal-dual algorithms

Mathematics Subject Classification ID

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

Cited In (19)

• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• A unified primal-dual algorithm framework based on Bregman iteration
• Bregman three-operator splitting methods
• Nonlinear forward-backward splitting with projection correction
• An implementable first-order primal-dual algorithm for structured convex optimization
• Generating structured nonsmooth priors and associated primal-dual methods
• A new primal-dual algorithm for structured convex optimization involving a Lipschitzian term
• Shadow Douglas-Rachford splitting for monotone inclusions
• A golden ratio primal-dual algorithm for structured convex optimization
• On the convergence of stochastic primal-dual hybrid gradient
• A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
• Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods
• A primal-dual algorithm framework for convex saddle-point optimization
• Convergence analysis of a primal-dual optimization-by-continuation algorithm
• Local linear convergence of a primal-dual algorithm for the augmented convex models
• Proximal-based pre-correction decomposition methods for structured convex minimization problems
• A generalized forward-backward splitting operator: degenerate analysis and applications
• The PRIMPING routine -- tiling through proximal alternating linearized minimization
• A unified primal-dual algorithm framework for inequality constrained problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415201)