Loading...

A nonlinear acceleration method for iterative algorithms

Shamsi, M ; Sharif University of Technology | 2020

372 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.sigpro.2019.107346
  3. Publisher: Elsevier B.V , 2020
  4. Abstract:
  5. Iterative methods have led to better understanding and solving problems such as missing sampling, deconvolution, inverse systems, and impulsive and Salt and Pepper noise removal problems. However, the challenges regarding the speed of convergence and or the accuracy of the answer still remain. In order to improve the existing iterative algorithms, a non-linear method is discussed in this paper. The mentioned method is analyzed from different aspects, including its convergence and its ability to accelerate recursive algorithms. We show that this method is capable of improving Iterative Method (IM) as a non-uniform sampling reconstruction algorithm and some other iterative sparse recovery algorithms such as Iterative Reweighted Least Squares (IRLS), Iterative Method with Adaptive Thresholding (IMAT), Smoothed ℓ0 (SL0) and Alternating Direction Method of Multipliers (ADMM) for solving LASSO problem family (including LASSO itself, LASSO-LSQR and Group-LASSO). It is also capable of both accelerating and stabilizing the well-known Chebyshev Acceleration (CA) method. Furthermore, the proposed algorithm can extend the stability range by reducing the sensitivity of iterative algorithms to the changes of adaptation rate. © 2019 Elsevier B.V
  6. Keywords:
  7. Acceleration Methods ; IMAT ; Iterative Methods ; LASSO ; Non-Linear Acceleration ; Sparse Recovery ; Deconvolution ; Inverse problems ; Least squares approximations ; Regression analysis ; Salt removal ; Acceleration method ; IMAT ; LASSO ; Non linear ; Sparse recovery ; Iterative methods
  8. Source: Signal Processing ; Volume 168 , 2020
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0165168419303998