Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#329099] of Ingrid Daubechies

Papers Published

  1. Voronin, S; Daubechies, I, An iteratively reweighted least squares algorithm for sparse regularization, in Contemporary Mathematics, vol. 693 (January, 2017), pp. 391-411 [doi]
    (last updated on 2017/12/15)

    © 2017 by the authors. We present a new algorithm and the corresponding convergence analysis for the regularization of linear inverse problems with sparsity constraints, applied to a new generalized sparsity promoting functional. The algorithm is based on the idea of iteratively reweighted least squares, reducing the minimization at every iteration step to that of a functional including only ℓ 2 -norms. This amounts to smoothing of the absolute value function that appears in the generalized sparsity promoting penalty we consider, with the smoothing becoming iteratively less pronounced. We demonstrate that the sequence of iterates of our algorithm converges to a limit that minimizes the original functional.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320