A semismooth Newton method for Tikhonov functionals with sparsity constraints
From MaRDI portal
Abstract: Minimization problems in for Tikhonov functionals with sparsity constraints are considered. Sparsity of the solution is ensured by a weighted penalty term. The necessary and sufficient condition for optimality is shown to be slantly differentiable (Newton differentiable), hence a semismooth Newton method is applicable. Local superlinear convergence of this method is proved. Numerical examples are provided which show that our method compares favorably with existing approaches.
Recommendations
- On the role of sparsity in inverse problems
- Global convergence of damped semismooth Newton methods for \(\ell_{1}\) Tikhonov regularization
- On the minimization of a Tikhonov functional with a non-convex sparsity constraint
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems
- A generalized conditional gradient method for nonlinear operator equations with sparsity constraints
Cited in
(40)- A semi-smooth Newton method for inverse problem with uniform noise
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- Numerical identification of a sparse Robin coefficient
- 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
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- \(l^1\)-weighted regularization for the problem of recovering sparse initial conditions in parabolic equations from final measurements
- Numerical solution of time-dependent component with sparse structure of source term for a time fractional diffusion equation
- A proximal regularized Gauss-Newton-Kaczmarz method and its acceleration for nonlinear ill-posed problems
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- On the minimization of a Tikhonov functional with a non-convex sparsity constraint
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- Semismooth Newton and quasi-Newton methods in weighted ^1-regularization
- Approximation of penalty terms in Tikhonov functional-theory and applications in inverse problems
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Convergence and regularization results for optimal control problems with sparsity functional
- A note on the minimization of a Tikhonov functional with \(\ell^1\)-penalty
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
- A Projection Proximal-Point Algorithm for ℓ1Minimization
- On the role of sparsity in inverse problems
- Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem
- A global minimization algorithm for Tikhonov functionals with sparsity constraints
- CT image reconstruction algorithms based on the Hanke Raus parameter choice rule
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- An inverse source problem with sparsity constraint for the time-fractional diffusion equation
- Global convergence of damped semismooth Newton methods for \(\ell_{1}\) Tikhonov regularization
- A generalized conditional gradient method for nonlinear operator equations with sparsity constraints
- An inexact semismooth Newton method on Riemannian manifolds with application to duality-based total variation denoising
- An efficient variational model for multiplicative noise removal
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Identification of sparsely representable diffusion parameters in elliptic problems
- Cardinality minimization, constraints, and regularization: a survey
- On SCD semismooth^* Newton methods for the efficient minimization of Tikhonov functionals with non-smooth and non-convex penalties
- A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
- On the analysis of semismooth Newton-type methods for composite optimization
- Samplets: wavelet concepts for scattered data
- A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
- Linear convergence of iterative soft-thresholding
- Non-convex sparse regularisation
- Sparse approximate solution of partial differential equations
This page was built for publication: A semismooth Newton method for Tikhonov functionals with sparsity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507929)
