Primal-dual multigrid methods for nonsmooth optimization

DOI10.48550/arXiv.2608.04848MaRDI QIDQ7284617arXivFDO

Authors Felipe Guerra, Tuomo Valkonen

Publication date 5 August 2026

Published in arXiv

Tldr We propose a new primal-dual multigrid approach for nonsmooth optimization that can efficiently handle nonsmooth composite functions and linear constraints, particularly suitable for total variation regularized inverse imaging problems.

Full work available at URL https://doi.org/10.48550/arXiv.2608.04848

arXiv classification

math.NAmath.OC

Cites work

• A first-order primal-dual algorithm with linesearch
• A multigrid approach to discretized optimization problems
• A multilevel proximal gradient algorithm for a class of composite optimization problems
• A splitting algorithm for dual monotone inclusions involving cocoercive operators
• An algorithm for total variation minimization and applications
• Differential estimates for fast first-order multilevel nonconvex optimisation
• Introduction to Nonsmooth Analysis and Optimization
• MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
• MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
• Multigrid methods for total variation
• Numerical Optimization
• On the convergence of primal-dual hybrid gradient algorithm
• Online optimisation for dynamic electrical impedance tomography
• Preconditioned ADMM with nonlinear operator constraint
• Preconditioned ADMM with nonlinear operator constraint
• Primal-dual extragradient methods for nonlinear nonsmooth PDE-constrained optimization
• Testing and non-linear preconditioning of the proximal point method
• The mathematics of computerized tomography

This page was built for publication: Primal-dual multigrid methods for nonsmooth optimization

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