Iterative regularization via dual diagonal descent
From MaRDI portal
Abstract: In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal {descent} method. Our analysis establishes convergence as well as stability results. Theoretical findings are complemented with numerical experiments showing state of the art performances.
Recommendations
- Accelerated iterative regularization via dual diagonal descent
- A statistical view of iterative methods for linear inverse problems
- Iterative regularization with a general penalty term-theory and application to \(L^{1}\) and \(TV\) regularization
- Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 4030337 (Why is no real title available?)
- scientific article; zbMATH DE number 1194487 (Why is no real title available?)
- scientific article; zbMATH DE number 3659298 (Why is no real title available?)
- scientific article; zbMATH DE number 3566540 (Why is no real title available?)
- scientific article; zbMATH DE number 1460261 (Why is no real title available?)
- scientific article; zbMATH DE number 2146003 (Why is no real title available?)
- scientific article; zbMATH DE number 854129 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- A first order method for finding minimal norm-like solutions of convex optimization problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A guide to the TV zoo
- A modified Landweber iteration for solving parameter estimation problems
- A monotone+skew splitting model for composite monotone inclusions in duality
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- A strongly convergent iterative solution of \(0 \in U(x)\) for a maximal monotone operator U in Hilbert space
- A variational formulation for frame-based inverse problems
- A wavelet tour of signal processing. The sparse way.
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Asymptotic behavior of coupled dynamical systems with multiscale aspects
- Asymptotic behavior of nonautonomous monotone and subgradient evolution equations
- Automated parameter selection for total variation minimization in image restoration
- Convergence of diagonally stationary sequences in convex optimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex optimization in normed spaces. Theory, methods and examples
- Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
- Coupling the gradient method with a general exterior penalization scheme for convex minimization
- Coupling the proximal point algorithm with approximation methods
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- Dualization of signal recovery problems
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- Estimation of the mean of a multivariate normal distribution
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- From error bounds to the complexity of first-order descent methods for convex functions
- Image recovery via total variation minimization and related problems
- Infimal convolution of data discrepancies for mixed noise removal
- Iteration processes of convex programming with internal regularization
- Iterative regularization methods for nonlinear ill-posed problems
- Iterative regularization with a general penalty term-theory and application to \(L^{1}\) and \(TV\) regularization
- Iterative total variation schemes for nonlinear inverse problems
- Joint and separate convexity of the Bregman distance.
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- NESTA: A fast and accurate first-order method for sparse recovery
- Nonlinear total variation based noise removal algorithms
- On equiwellset minimum problems
- Penalization in non-classical convex programming via variational convergence
- Penalty-proximal methods in convex programming
- Perturbation des méthodes d'optimisation. Applications
- Primal and dual convergence of a proximal point exponential penalty method for linear programming
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Prox-penalization and splitting methods for constrained variational problems
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Proximal splitting methods in signal processing
- Quasi-Fejérian analysis of some optimization algorithms
- Regularization and Variable Selection Via the Elastic Net
- Signal Recovery by Proximal Forward-Backward Splitting
- Splitting forward-backward penalty scheme for constrained variational problems
- Stein Unbiased GrAdient estimator of the Risk (SUGAR) for Multiple Parameter Selection
- Strong asymptotic convergence of evolution equations governed by maximal monotone operators with Tikhonov regularization
- Subspace correction methods for a class of nonsmooth and nonadditive convex variational problems with mixed \(L^1/L^2\) data-fidelity in image processing
- Support Vector Machines
- TIGRA an iterative algorithm for regularizing nonlinear ill-posed problems
- The perturbed Tikhonov's algorithm and some of its applications
- The steepest descent dynamical system with control. Applications to constrained minimization
- Total generalized variation
- Viscosity Solutions of Minimization Problems
- Well-posed optimization problems
Cited in
(20)- Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization
- Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization
- Iterative Regularization and MINRES
- Fast iterative regularization by reusing data
- Implicit regularization with strongly convex bias: Stability and acceleration
- Iterative regularization for low complexity regularizers
- Bregman methods for large-scale optimization with applications in imaging
- Data-informed regularization for inverse and imaging problems
- A Fast Data-Driven Iteratively Regularized Method with Convex Penalty for Solving Ill-Posed Problems
- A statistical view of iterative methods for linear inverse problems
- A proximal interior point algorithm with applications to image processing
- Accelerated iterative regularization via dual diagonal descent
- A method with convergence rates for optimization problems with variational inequality constraints
- Tomographic image reconstruction with a spatially varying gamma mixture prior
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Choose your path wisely: gradient descent in a Bregman distance framework
- Alternating forward-backward splitting for linearly constrained optimization problems
- An online convex optimization-based framework for convex bilevel optimization
- Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
- Polynomial preconditioners for regularized linear inverse problems
This page was built for publication: Iterative regularization via dual diagonal descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703168)
