English

A global minimization algorithm for Tikhonov functionals with sparsity constraints

Numerical Analysis 2015-08-05 v2

Abstract

In this paper we present a globally convergent algorithm for the computation of a minimizer of the Tikhonov functional with sparsity promoting penalty term for nonlinear forward operators in Banach space. The dual TIGRA method uses a gradient descent iteration in the dual space at decreasing values of the regularization parameter αj\alpha_j, where the approximation obtained with αj\alpha_j serves as the starting value for the dual iteration with parameter αj+1\alpha_{j+1}. With the discrepancy principle as a global stopping rule the method further yields an automatic parameter choice. We prove convergence of the algorithm under suitable step-size selection and stopping rules and illustrate our theoretic results with numerical experiments for the nonlinear autoconvolution problem.

Keywords

Cite

@article{arxiv.1401.0435,
  title  = {A global minimization algorithm for Tikhonov functionals with sparsity constraints},
  author = {Wei Wang and Stephan W. Anzengruber and Ronny Ramlau and Bo Han},
  journal= {arXiv preprint arXiv:1401.0435},
  year   = {2015}
}
R2 v1 2026-06-22T02:38:13.675Z