Iterative methods are extensively used to solve linear and nonlinear problems arising from both pure and applied sciences, and in particular, in fixed point theory and optimization. An iterative method which is used to find a fixed point of an operator or an optimal solution to an optimization problem generates a sequence in an iterative manner. We are in a hope that
this sequence can converge to a solution of the problem under investigation. It is therefore quite naturally to require that the distance of this sequence to the solution set of the problem under investigation be decreasing from iteration to iteration. This is the idea of Fejer-monotonicity. In this paper, We consider quasi-Fejer monotone sequences; that is, we consider Fejer monotone sequences together with errors. Properties of quasi-Fejer monotone sequences are investigated, weak and strong convergence of quasi-Fejer monotone sequences are obtained, and an application to the convex feasibility problem is included.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0705111-104240 |
| Date | 05 July 2011 |
| Creators | Huang, Jun-Hua |
| Contributors | Lai-Jiu Lin, Hong-Kun Xu, Yen-Cherng Lin, Jen-Chih Yao |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705111-104240 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0115 seconds