کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4605483 | 1337575 | 2009 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Accelerating gradient projection methods for ℓ1-constrained signal recovery by steplength selection rules
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آنالیز ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Accelerating gradient projection methods for ℓ1-constrained signal recovery by steplength selection rules Accelerating gradient projection methods for ℓ1-constrained signal recovery by steplength selection rules](/preview/png/4605483.png)
چکیده انگلیسی
We propose a new gradient projection algorithm that compares favorably with the fastest algorithms available to date for ℓ1-constrained sparse recovery from noisy data, both in the compressed sensing and inverse problem frameworks. The method exploits a line-search along the feasible direction and an adaptive steplength selection based on recent strategies for the alternation of the well-known Barzilai–Borwein rules. The convergence of the proposed approach is discussed and a computational study on both well conditioned and ill-conditioned problems is carried out for performance evaluations in comparison with five other algorithms proposed in the literature.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied and Computational Harmonic Analysis - Volume 27, Issue 2, September 2009, Pages 247-254
Journal: Applied and Computational Harmonic Analysis - Volume 27, Issue 2, September 2009, Pages 247-254