@ARTICLE\{IMM2007-03436,
    author       = "P. C. Hansen and T. K. Jensen and G. Rodriguez",
    title        = "An adaptive pruning algorithm for the discrete {L-}curve criterion",
    year         = "2007",
    pages        = "483-492",
    journal      = "Journal of Computational and Applied Mathematics",
    volume       = "198",
    editor       = "",
    number       = "2",
    publisher    = "",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/3436-full.html",
    abstract     = "We describe a robust and adaptive implementation of the {L-}curve criterion, i.e., for locating the corner of a discrete {L-}curve consisting of a log-log plot of corresponding residual and solution norms of regularized solutions from a method with a discrete regularization parameter (such as truncated {SVD} or regularizing {CG} iterations). Our algorithm needs no pre-defined parameters, and in order to capture the global features of the curve in an adaptive fashion, we use a sequence of pruned {L-}curves that correspond to considering the curves at different scales. We compare our new algorithm to existing algoritms and demonstrate its robustness by numerical examples."
}