Hybrid steepest iterative algorithm for a hierarchical fixed point problem

Husain, S and Singh, N. (2017) Hybrid steepest iterative algorithm for a hierarchical fixed point problem. Fixed Point Theory and Applications, 2017 (1). ISSN 16871820

Full text not available from this repository.
Official URL: https://fixedpointtheoryandapplications.springerop...

Abstract

The purpose of this work is to introduce and study an iterative method to approximate solutions of a hierarchical fixed point problem and a variational inequality problem involving a finite family of nonexpansive mappings on a real Hilbert space. Further, we prove that the sequence generated by the proposed iterative method converges to a solution of the hierarchical fixed point problem for a finite family of nonexpansive mappings which is the unique solution of the variational inequality problem. The results presented in this paper are the extension and generalization of some previously known results in this area. An example which satisfies all the conditions of the iterative method and the convergence result is given. © 2017, The Author(s).

Item Type: Article
Uncontrolled Keywords: fixed point problem; nonexpansive mapping; strongly monotone; variational inequalities
Subjects: T Technology > T Technology (General)
Divisions: Faculties > Faculty of Engineering and Technology > Zakir Husain College of Engineering & Technology > Department of Applied Mathematics
Depositing User: AMU Library
Date Deposited: 30 Jan 2018 06:51
Last Modified: 31 Jan 2018 06:26
URI: http://ir.amu.ac.in/id/eprint/11041

Actions (login required)

View Item View Item