A new faster iteration process applied to constrained minimization and feasibility problems

239 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A PICARD-S HYBRID TYPE ITERATION METHOD FOR SOLVING A DIFFERENTIAL EQUATION WITH RETARDED ARGUMENT (2014, methodology): “int x∗ be as in Theorem 1. Let {un}∞ n=0 , {x n}∞ =0 be two iterative sequences deﬁned by CR (1.10) and Picard-S (1.14) iteration methods, respectively, with real sequences ηi n ∞ n=0 , i∈ {1,2,3} in [0,1] satisfying Pn k=0η 1 kη 2 k = ∞. Then the following are equivalent: (i) limn→∞ kxn −x∗k = 0; (”
A new iteration scheme for approximating fixed points of nonexpansive mappings (2016, unknown): “Now, we present an example which shows that our iteration process (7) converges at a rate faster than Abbas and Nazir’s iteration process (6), Agarwal et al. iteration process (5), Mann iteration (2), Ishikawa iteration (3), Noor iteration (4) and Picard iteration process (1).”
Numerical reckoning fixed points for Suzuki’s generalized nonexpansive mappings via new iteration process (2018, methodology): “(4) With the help of numerical example they proved that (4) is faster than Picard, Mann, Ishikawa, Agarwal, Noor and Abbas iteration process for suzuki generalized nonexpansive mappings.”