A Semismooth Newton Method for Tikhonov Functionals with Sparsity Constraints
Abstract
Minimization problems in 2 for Tikhonov functionals with sparsity constraints are considered. Sparsity of the solution is ensured by a weighted 1 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.