On SCD Semismooth * Newton methods for the efficient minimization of Tikhonov functionals with non-smooth and non-convex penalties
Open Access
- 24 June 2025
- journal article
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (7) , 075002
Abstract
We consider the efficient numerical minimization of Tikhonov functionals with nonlinear operators and non-smooth and non-convex penalty terms, which appear for example in variational regularization. For this, we consider a new class of subspace-containing derivative (SCD) semismooth * Newton methods, which are based on a novel concept of graphical derivatives, and exhibit locally superlinear convergence. We present a detailed description of these methods, and provide explicit algorithms in the case of sparsity and total-variation penalty terms. The numerical performance of these methods is then illustrated on a number of tomographic imaging problems.Keywords
All Related Versions
Funding Information
- Austrian Science Fund (10.55776/F68)
This publication has 49 references indexed in Scilit:
- Majorization–minimization generalized Krylov subspace methods for ${\ell _p}$–${\ell _q}$ optimization applied to image restorationBIT Numerical Mathematics, 2017
- Regularization of Inverse Problems2015
- A superlinearly convergent R-regularized Newton scheme for variational models with concave sparsity-promoting priorsComputational Optimization and Applications, 2013
- Iteratively reweighted least squares minimization for sparse recoveryCommunications on Pure and Applied Mathematics, 2009
- A generalized conditional gradient method and its connection to an iterative shrinkage methodComputational Optimization and Applications, 2007
- A Tikhonov-based projection iteration for nonlinear Ill-posed problems with sparsity constraintsNumerische Mathematik, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- A nonsmooth version of Newton's methodMathematical Programming, 1993
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969