Iterative regularization via dual diagonal descent (Q1703168)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Iterative regularization via dual diagonal descent	scientific article

Statements

scholarly article

0 references

Iterative regularization via dual diagonal descent (English)

0 references

Guillaume Garrigos

0 references

Lorenzo Rosasco

0 references

0 references

Journal of Mathematical Imaging and Vision

0 references

publication date

1 March 2018

0 references

full work available at URL

https://arxiv.org/abs/1610.02170

0 references

zbMATH Keywords

splitting methods

0 references

dual problem

0 references

diagonal methods

0 references

iterative regularization

0 references

early stopping

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Penalization in non-classical convex programming via variational convergence

0 references

Primal and dual convergence of a proximal point exponential penalty method for linear programming

0 references

Viscosity Solutions of Minimization Problems

0 references

Asymptotic behavior of nonautonomous monotone and subgradient evolution equations

0 references

Asymptotic behavior of coupled dynamical systems with multiscale aspects

0 references

Prox-Penalization and Splitting Methods for Constrained Variational Problems

0 references

Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities

0 references

Penalty-proximal methods in convex programming

0 references

Iterative total variation schemes for nonlinear inverse problems

0 references

Convergence of diagonally stationary sequences in convex optimization

0 references

0 references

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

A first order method for finding minimal norm-like solutions of convex optimization problems

0 references

Mirror descent and nonlinear projected subgradient methods for convex optimization.

0 references

NESTA: A Fast and Accurate First-Order Method for Sparse Recovery

0 references

0 references

From error bounds to the complexity of first-order descent methods for convex functions

0 references

Iterative regularization with a general penalty term—theory and application to <i>L</i> <sup>1</sup> and <i>TV</i> regularization

0 references

0 references

Total Generalized Variation

0 references

A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality

0 references

A strongly convergent iterative solution of \(0 \in U(x)\) for a maximal monotone operator U in Hilbert space

0 references

A Guide to the TV Zoo

0 references

Error estimation for Bregman iterations and inverse scale space methods in image restoration

0 references

The steepest descent dynamical system with control. Applications to constrained minimization

0 references

Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization

0 references

Infimal Convolution of Data Discrepancies for Mixed Noise Removal

0 references

A variational formulation for frame-based inverse problems

0 references

Image recovery via total variation minimization and related problems

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions

0 references

0 references

Dualization of signal recovery problems

0 references

Proximal Splitting Methods in Signal Processing

0 references

Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

Strong asymptotic convergence of evolution equations governed by maximal monotone operators with Tikhonov regularization

0 references

Coupling the proximal point algorithm with approximation methods

0 references

Splitting forward-backward penalty scheme for constrained variational problems

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Stein Unbiased GrAdient estimator of the Risk (SUGAR) for Multiple Parameter Selection

0 references

Well-posed optimization problems

0 references

Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors

0 references

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

Subspace Correction Methods for a Class of Nonsmooth and Nonadditive Convex Variational Problems with Mixed $L^1/L^2$ Data-Fidelity in Image Processing

0 references

Iterative regularization methods for nonlinear ill-posed problems

0 references

0 references

Iteration processes of convex programming with internal regularization

0 references

Automated parameter selection for total variation minimization in image restoration

0 references

0 references

0 references

0 references

0 references

Perturbation des méthodes d'optimisation. Applications

0 references

Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers

0 references

Coupling the gradient method with a general exterior penalization scheme for convex minimization

0 references

Convex Optimization in Normed Spaces

0 references

TIGRA an iterative algorithm for regularizing nonlinear ill-posed problems

0 references

Nonlinear total variation based noise removal algorithms

0 references

A modified Landweber iteration for solving parameter estimation problems

0 references

Estimation of the mean of a multivariate normal distribution

0 references

Support Vector Machines

0 references

The perturbed Tikhonov's algorithm and some of its applications

0 references

Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities

0 references

0 references

Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings

0 references

On equiwellset minimum problems

0 references

Regularization and Variable Selection Via the Elastic Net

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10851-017-0754-0

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1703168

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1703168&oldid=36376617"