A new faster iteration process applied to constrained minimization and feasibility problems
| dc.contributor.author | Abbas, Mujahid | |
| dc.contributor.author | Nazir, Talat | |
| dc.date.accessioned | 2015-02-17T05:23:14Z | |
| dc.date.available | 2015-02-17T05:23:14Z | |
| dc.date.issued | 2014-06 | |
| dc.description.abstract | We introduce a new iteration process and prove that it is faster than all of Picard, Mann and Agarwal et al. processes. We support analytic proof by a numerical example. Our process is independent of all three processes just mentioned. We also prove some weak and strong convergence theorems for two nonexpansive mappings. Moreover, we apply our results to find solutions of constrained minimization problems and feasibility problems. | en_ZA |
| dc.description.librarian | hb2015 | en_ZA |
| dc.description.uri | http://www.emis.dejournals/MV/ | en_ZA |
| dc.identifier.citation | Abbas, M & Nazir, T 2014, 'A new faster iteration process applied to constrained minimization and feasibility problems', Matematicki Vesnik , vol. 66, no. 2, pp. 223-234. | en_ZA |
| dc.identifier.issn | 0025-5165 (online) | |
| dc.identifier.uri | http://hdl.handle.net/2263/43663 | |
| dc.language.iso | en | en_ZA |
| dc.publisher | Mathematical Society of Serbia | en_ZA |
| dc.rights | © 2014 Mathematical Society of Serbia. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.orglicenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. | en_ZA |
| dc.subject | Nonexpansive mapping | en_ZA |
| dc.subject | Weak convergence | en_ZA |
| dc.subject | Strong convergence | en_ZA |
| dc.subject | Rate of convergence | en_ZA |
| dc.subject | Iteration process | en_ZA |
| dc.title | A new faster iteration process applied to constrained minimization and feasibility problems | en_ZA |
| dc.type | Article | en_ZA |