The problem of minimizing the sum of nonsmooth, convex objective functions defined on a real Hilbert space over the intersection of fixed point sets of nonexpansive mappings, onto which the projections cannot be efficiently computed, is considered. The use of proximal point algorithms that use the proximity operators of the objective functions and incremental optimization techniques is proposed...

In this article, we apply the modified variational iteration method for solving the (1+1)dimensional Ramani equations and the (1+1)-dimensional Joulent Moidek (JM) equations together with the initial conditions. The proposed method is modified the variational iteration method by the introducing He’s polynomials in the correction functional. The analytical results are calculated in terms of conv...

We prove a strong convergence theorem for the modified Noor iterations‎ ‎in the framework of CAT(0) spaces‎. ‎Our results extend and improve the corresponding results of‎ ‎X‎. ‎Qin‎, ‎Y‎. ‎Su and M‎. ‎Shang‎, ‎T‎. ‎H‎. ‎Kim and H‎. ‎K‎. ‎Xu and S‎. ‎Saejung‎ ‎and some others‎.

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

Based on He's variational iteration method idea, we modified the fractional variational iteration method and applied it to construct some approximate solutions of the generalized time-space fractional Schrödinger equation (GFNLS). The fractional derivatives are described in the sense of Caputo. With the help of symbolic computation, some approximate solutions and their iterative structure of th...

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

For the discretized linear systems of spatial fractional diffusion equations, we construct a class modified DTS iteration method and give its asymptotic convergence conditions. Then, design fast preconditioner by replacing Toeplitz matrix T with τ to accelerate rates GMRES method. Theoretically, show that spectrum preconditioned is clustered around one. Numerical experiments verify validity con...