The split equality problem has wide applicability in many fields of applied mathematics. In this paper, by using the inertial extrapolation, we introduce an inertial projection algorithm for solving the split equality problem. The weak convergence of the proposed algorithm is shown. Finally, we present a numerical example to illustrate the efficiency of the inertial projection algorithm. c ©201...

A block affine projection algorithm that it is mathematically equivalent to a recently proposed Gauss-Seidel Pseudo Affine Projection (GS -PAP) algorithm is proposed. A partitioning method is applied to the original sample-bysample algorithm. It is shown that the derived algorithm has better convergence, tracking abilities and much reduced complexity than the NLMS algorithm. Its application in ...

We present a method to reconstruct images from finite sets of noisy projections that may be available only over limited or sparse angles. The algorithm calculates the maximum a posteriori (MAP) estimate of the full sinogram (which is an image of the 2-D Radon transform of the object) from the available data. It is implemented using a primal-dual constrained optimization procedure that solves a ...

We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear equations and non-negativity constraints. Then it uses a procedure that either finds a solution for the respective homogeneous system or provides the information based on which the algorithm rescales the homogeneous system so that its fea...

In this paper we propose a new stable Fast Affine Projection algorithm based on Gauss -Seidel iterations (GSFAP). We investigate its implementation using the logarithmic number system (LNS) and compare it with other two FAP algorithms. A method to simplify its implementation is also proposed. We show that the 32-bit or 20-bit LNS implementation of the GSFAP algorithm is superior to those of oth...