paper

On the performance of algorithms for the minimization of -penalized functionals

arXiv:0710.4082 · doi:10.1088/0266-5611/25/3/035008

Abstract

The problem of assessing the performance of algorithms used for the minimization of an -penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of `approximation isochrones' is introduced. Five different iterative minimization algorithms are tested and compared, as well as two warm-start strategies. Both well-conditioned and ill-conditioned problems are used in the comparison, and the contrast between these two categories is highlighted.

18 pages, 10 figures; v3: expanded version with an additional synthetic test problems

References in corpus (3)

Cited by in corpus (16)