Sparse sampling Kaczmarz–Motzkin method with linear convergence
نویسندگان
چکیده
The randomized sparse Kaczmarz method was recently proposed to recover solutions of linear systems. In this work, we introduce a greedy variant the by employing sampling Kaczmarz-Motzkin method, and prove its convergence in expectation with respect Bregman distance noiseless noisy cases. This can be viewed as unification hence inherits merits these two methods. Numerically, report couple experimental results demonstrate superiority
منابع مشابه
Linear convergence of the Randomized Sparse Kaczmarz Method
The randomized version of the Kaczmarz method for the solution of linear systems is known to converge linearly in expectation. In this work we extend this result and show that the recently proposed Randomized Sparse Kaczmarz method for recovery of sparse solutions, as well as many variants, also converges linearly in expectation. The result is achieved in the framework of split feasibility prob...
متن کاملSparse Signal Sampling using Noisy Linear Projections
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission.
متن کاملRobust Estimation in Linear Regression with Molticollinearity and Sparse Models
One of the factors affecting the statistical analysis of the data is the presence of outliers. The methods which are not affected by the outliers are called robust methods. Robust regression methods are robust estimation methods of regression model parameters in the presence of outliers. Besides outliers, the linear dependency of regressor variables, which is called multicollinearity...
متن کاملOn Globally Linear Convergence of Dual Gradient Descent Method for Sparse Solutions
In [14], researchers studied the convergence of a dual gradient descent algorithm for sparse solutions of undetermined linear systems and showed that it has a globally linear convergence. In this paper we present another analysis. Mainly, we remove one assumption of completely full rankness on the linear system from the convergence result in [14] and provide with a different argument which sign...
متن کاملDesign of Sparse Linear Arrays by Monte Carlo Importance Sampling
The formation of acoustic images in real-time requires an enormous computational burden. To reduce this demand the use of sparse arrays for beamforming is mandated. The design of these arrays for adequate mainlobe width and low sidelobe level is a difficult nonlinear optimization problem. A new approach to the joint optimization of sensor placement and shading weights is discussed. Based on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods in The Applied Sciences
سال: 2021
ISSN: ['1099-1476', '0170-4214']
DOI: https://doi.org/10.1002/mma.7990