A semismooth Newton method for Tikhonov functionals with sparsity constraints

DOI10.1088/0266-5611/24/3/035007zbMath1152.49030arXiv0709.3186OpenAlexW3098608218MaRDI QIDQ3507929

Dirk A. Lorenz, Roland Griesse

Publication date: 24 June 2008

Published in: Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

necessary and sufficient condition for optimalityTikhonov functionalsminimization problems in \(\ell^{2}\)

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Optimality conditions for problems in abstract spaces (49K27)

Related Items (26)

Further properties of the forward-backward envelope with applications to difference-of-convex programming ⋮ Convergence and regularization results for optimal control problems with sparsity functional ⋮ A semi-smooth Newton method for inverse problem with uniform noise ⋮ A family of second-order methods for convex \(\ell _1\)-regularized optimization ⋮ Non-convex sparse regularisation ⋮ Nonconvex flexible sparsity regularization: theory and monotone numerical schemes ⋮ Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem ⋮ A regularized semi-smooth Newton method with projection steps for composite convex programs ⋮ Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method ⋮ Numerical solution of time-dependent component with sparse structure of source term for a time fractional diffusion equation ⋮ Convergence rates and source conditions for Tikhonov regularization with sparsity constraints ⋮ A note on the minimization of a Tikhonov functional with ℓ¹-penalty ⋮ An Inverse Source Problem with Sparsity Constraint for the Time-Fractional Diffusion Equation ⋮ A Projection Proximal-Point Algorithm for ℓ¹Minimization ⋮ Sparse approximate solution of partial differential equations ⋮ Numerical identification of a sparse Robin coefficient ⋮ A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares ⋮ A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems ⋮ A unified primal dual active set algorithm for nonconvex sparse recovery ⋮ Linear convergence of iterative soft-thresholding ⋮ A proximal regularized Gauss-Newton-Kaczmarz method and its acceleration for nonlinear ill-posed problems ⋮ Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem ⋮ CT image reconstruction algorithms based on the Hanke Raus parameter choice rule ⋮ \(l^1\)-weighted regularization for the problem of recovering sparse initial conditions in parabolic equations from final measurements ⋮ An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising ⋮ An Efficient Variational Model for Multiplicative Noise Removal

This page was built for publication: A semismooth Newton method for Tikhonov functionals with sparsity constraints