Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization

DOI10.1007/S11075-020-00909-6zbMATH Open1459.65090arXiv1807.05793OpenAlexW3014692957MaRDI QIDQ2220748FDOQ2220748

Authors: Erdem Altuntac 

Publication date: 25 January 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: Focus of this work is solving a non-smooth constraint minimization problem by a primal-dual splitting algorithm involving proximity operators. The problem is penalized by the Bregman divergence associated with the non-smooth total variation (TV) functional. We analyse two aspects: Firstly, the convergence of the regularized solution of the minimization problem to the minimum norm solution. Second, the convergence of the iteratively regularized minimizer to the minimum norm solution by a primal-dual algorithm. For both aspects, we use the assumption of a variational source condition (VSC). This work emphasizes the impact of the choice of the parameters in stabilization of a primal-dual algorithm. Rates of convergence are obtained in terms of some concave, positive definite index function. The algorithm is applied to a simple two dimensional image processing problem. Sufficient error analysis profiles are provided based on the size of the forward operator and the noise level in the measurement.

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

Recommendations

• Parameter choice in Banach space regularization under variational inequalities
• scientific article; zbMATH DE number 409757
• A Bregman iterative algorithm for solving \(l^1\) minimization problems
• A unified primal-dual algorithm framework based on Bregman iteration
• A choice of the regularization parameter in solving convex extremal problems
• scientific article; zbMATH DE number 4020348
• Heuristic Parameter-Choice Rules for Convex Variational Regularization Based on Error Estimates
• scientific article; zbMATH DE number 949736
• A dual Bregman proximal gradient method for relatively-strongly convex optimization
• Iterative regularization via dual diagonal descent

zbMATH Keywords

Bregman distanceprimal-dual algorithmiterative regularizationproximal mappingtotal variation functional

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Regularity of solutions in optimal control (49N60) Inverse problems in optimal control (49N45)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Nonlinear total variation based noise removal algorithms
• Convex analysis and monotone operator theory in Hilbert spaces
• Title not available (Why is that?)
• Proximal splitting methods in signal processing
• Image recovery via total variation minimization and related problems
• Regularization properties of the sequential discrepancy principle for Tikhonov regularization in Banach spaces
• Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
• Convergence rates for Morozov's discrepancy principle using variational inequalities
• Parameter choice in Banach space regularization under variational inequalities
• Regularization methods in Banach spaces.
• Convergence rates of convex variational regularization
• Title not available (Why is that?)
• Morozov's discrepancy principle for Tikhonov-type functionals with nonlinear operators
• Title not available (Why is that?)
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
• Analysis of bounded variation penalty methods for ill-posed problems
• A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
• Title not available (Why is that?)
• On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
• Iterative Methods for Total Variation Denoising
• An introduction to the mathematical theory of inverse problems
• Fixed point theorems for nonlinear non-self mappings in Hilbert spaces and applications
• Convex Tikhonov regularization in Banach spaces: new results on convergence rates
• Iterative total variation schemes for nonlinear inverse problems
• Convergence of an Iterative Method for Total Variation Denoising
• Verification of a variational source condition for acoustic inverse medium scattering problems
• Total variation-penalized Poisson likelihood estimation for ill-posed problems
• Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
• Generalized Bregman distances and convergence rates for non-convex regularization methods
• Fixed-point algorithms for inverse problems in science and engineering. Based on the presentations at the interdisciplinary workshop, BIRS, Banff, Canada, November 1--6, 2009.
• Title not available (Why is that?)
• An Optimization‐Based Multilevel Algorithm for Total Variation Image Denoising
• Analysis of regularized total variation penalty methods for denoising
• A Newton-type method for a transmission problem in inverse scattering
• Existence of variational source conditions for nonlinear inverse problems in Banach spaces
• Variational inequalities and higher order convergence rates for Tikhonov regularisation on Banach spaces
• Characterizations of variational source conditions, converse results, and maxisets of spectral regularization methods
• Iterative regularization via dual diagonal descent
• Modern regularization methods for inverse problems
• On starting and stopping criteria for nested primal-dual iterations

Cited In (1)

• Minimization and parameter estimation for seminorm regularization models with \(I\)-divergence constraints

Uses Software

• UNLocBoX

This page was built for publication: Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization

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