Iterative pre-conditioning for expediting the distributed gradient-descent method: The case of linear least-squares problem

Automatica ◽  
2022 ◽  
Vol 137 ◽  
pp. 110095
Author(s):  
Kushal Chakrabarti ◽  
Nirupam Gupta ◽  
Nikhil Chopra
2018 ◽  
Vol 34 (2) ◽  
pp. 183-190
Author(s):  
D. CARP ◽  
◽  
C. POPA ◽  
T. PRECLIK ◽  
U. RUDE ◽  
...  

In this paper we present a generalization of Strand’s iterative method for numerical approximation of the weighted minimal norm solution of a linear least squares problem. We prove convergence of the extended algorithm, and show that previous iterative algorithms proposed by L. Landweber, J. D. Riley and G. H. Golub are particular cases of it.


Geophysics ◽  
2011 ◽  
Vol 76 (5) ◽  
pp. V69-V77 ◽  
Author(s):  
Yang Liu ◽  
Sergey Fomel

Seismic data are often inadequately or irregularly sampled along spatial axes. Irregular sampling can produce artifacts in seismic imaging results. We have developed a new approach to interpolate aliased seismic data based on adaptive prediction-error filtering (PEF) and regularized nonstationary autoregression. Instead of cutting data into overlapping windows (patching), a popular method for handling nonstationarity, we obtain smoothly nonstationary PEF coefficients by solving a global regularized least-squares problem. We employ shaping regularization to control the smoothness of adaptive PEFs. Finding the interpolated traces can be treated as another linear least-squares problem, which solves for data values rather than filter coefficients. Compared with existing methods, the advantages of the proposed method include an intuitive selection of regularization parameters and fast iteration convergence. The technique was tested on benchmark synthetic and field data to prove it can successfully reconstruct data with decimated or missing traces.


Sign in / Sign up

Export Citation Format

Share Document