We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A projected gradient method for nonlinear inverse problems with 훼ℓ<sub>1</sub> − 훽ℓ<sub>2</sub> sparsity regularization.
- Authors
Zhao, Zhuguang; Ding, Liang
- Abstract
The non-convex α ∥ ⋅ ∥ ℓ 1 − β ∥ ⋅ ∥ ℓ 2 ( α ≥ β ≥ 0 ) regularization is a new approach for sparse recovery. A minimizer of the α ∥ ⋅ ∥ ℓ 1 − β ∥ ⋅ ∥ ℓ 2 regularized function can be computed by applying the ST-( α ℓ 1 − β ℓ 2 ) algorithm which is similar to the classical iterative soft thresholding algorithm (ISTA). Unfortunately, It is known that ISTA converges quite slowly, and a faster alternative to ISTA is the projected gradient (PG) method. Nevertheless, the current applicability of the PG method is limited to linear inverse problems. In this paper, we extend the PG method based on a surrogate function approach to nonlinear inverse problems with the α ∥ ⋅ ∥ ℓ 1 − β ∥ ⋅ ∥ ℓ 2 ( α ≥ β ≥ 0 ) regularization in the finite-dimensional space R n . It is shown that the presented algorithm converges subsequentially to a stationary point of a constrained Tikhonov-type functional for sparsity regularization. Numerical experiments are given in the context of a nonlinear compressive sensing problem to illustrate the efficiency of the proposed approach.
- Subjects
NONLINEAR equations; THRESHOLDING algorithms; NONLINEAR functions; INVERSE problems
- Publication
Journal of Inverse & Ill-Posed Problems, 2024, Vol 32, Issue 3, p513
- ISSN
0928-0219
- Publication type
Article
- DOI
10.1515/jiip-2023-0010