Search

We introduce a new idea of algorithmic structure, called assigning algorithm, using a finite collection of a subclass of strictly quasi‐nonexpansive operators. This new algorithm allows the iteration vectors to take steps on a pattern which is based on a connected directed acyclic graph. The sequential, simultaneous, and string‐averaging methods for solving convex feasibility problems are the special cases of the new algorithm which may be used to reduce idle time of processors in parallel implementations. We give a convergence analysis for such algorithmic structure with perturbation. Also, we extend some existence results of the split common fixed point problem based on the new algorithm. The performance of the new algorithm is illustrated with numerical examples from computed tomography. [ABSTRACT FROM AUTHOR]

We consider the problem of compressed sensing with a coherent tight frame and design an iteratively reweighted least squares algorithm to solve it. To analyze the problem, we propose a sufficient null space property under a tight frame (sufficient D‐NSP). We show that, if a measurement matrix A satisfies the sufficient D‐NSP of order s, then an s‐sparse signal under the tight frame can be exactly recovered. Furthermore, if A satisfies the restricted isometric property with tight frame D of order 2bs, then it also satisfies the sufficient D‐NSP of order as with a < b and b sufficiently large. We prove the convergence of the algorithm based on the sufficient D‐NSP and give the upper error bounds. In numerical experiments, we use the discrete cosine transform, discrete Fourier transform, and Haar wavelets to verify the effectiveness of this algorithm. With increasing measurement number, the signal‐to‐noise ratio increases monotonically. [ABSTRACT FROM AUTHOR]