The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings

DOI10.1137/140976601zbMath1328.68278arXiv1407.1723OpenAlexW2964088716MaRDI QIDQ5250014

Michael Moeller, Evgeny Strekalovskiy, Daniel Cremers, Thomas Möllenhoff

Publication date: 15 May 2015

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.1723

zbMATH Keywords

optimizationnonconvex optimizationfirst-order methodsoperator splitting methodssemiconvex

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (23)

A survey on some recent developments of alternating direction method of multipliers ⋮ The springback penalty for robust signal recovery ⋮ Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ On Proximal Algorithms with Inertial Effects Beyond Monotonicity ⋮ Enhanced total variation minimization for stable image reconstruction ⋮ Non-convex total variation regularization for convex denoising of signals ⋮ Acceleration of the PDHGM on partially strongly convex functions ⋮ Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems ⋮ An introduction to continuous optimization for imaging ⋮ Collaborative Total Variation: A General Framework for Vectorial TV Models ⋮ On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting ⋮ A logarithmic image prior for blind deconvolution ⋮ Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition ⋮ Levenberg-Marquardt method with general convex penalty for nonlinear inverse problems ⋮ A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization ⋮ Block-proximal methods with spatially adapted acceleration ⋮ Algorithmic versatility of SPF-regularization methods ⋮ An adaptive alternating direction method of multipliers ⋮ On convergence of the Arrow-Hurwicz method for saddle point problems ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming

Uses Software

• iPiano

Cites Work

• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• Nonlinear total variation based noise removal algorithms
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
• Variational methods in image segmentation with 7 image processing experiments
• Image sharpening by flows based on triple well potentials
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Fixed-point methods for a certain class of operators
• Linearly Constrained Nonsmooth and Nonconvex Minimization
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Compressed plane waves yield a compactly supported multiresolution basis for the Laplace operator
• A Difference of Convex Functions Algorithm for Switched Linear Regression
• Optimal approximations by piecewise smooth functions and associated variational problems
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• Dithering by Differences of Convex Functions
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• Variational Analysis
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
• Minimizing total variation flow
• A primal–dual hybrid gradient method for nonlinear operators with applications to MRI
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
• Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings