Skip to main content
Article thumbnail
Location of Repository

Accelerated Projected Steepest Descent Method for Nonlinear Inverse Problems with Sparsity Constraints, Inverse Problems 26

By Gerd Teschke and Claudia Borries


This paper is concerned with the construction of an iterative algorithm to solve nonlinear inverse problems with an ℓ1 constraint. One extensively studied method to obtain a solution of such an ℓ1 penalized problem is iterative soft-thresholding. Regrettably, such iteration schemes are computationally very intensive. A subtle alternative to iterative soft-thresholding is the projected gradient method that was quite recently proposed by Daubechies in [3]. The authors have shown that the proposed scheme is indeed numerically much thriftier. However, its current applicability is limited to linear inverse problems. In this paper we provide an extension of this approach to nonlinear problems. Adequately adapting the conditions on the (variable) thresholding parameter to the nonlinear nature, we can prove convergence in norm for this projected gradient method, with and without acceleration. A numerical verification is given in the context of nonlinear and non-ideal sensing. For this particular recovery problem we can achieve an impressive numerical performance (when comparing it to non-accelerated procedures)

Topics: Nonlinear inverse problems, sparse recovery, steepest descent method, nonlinear and non-ideal sensing
Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.