Abstract

In this paper, we introduce a general algorithm to approximate common fixed points for a countable family of nonexpansive mappings in a real Hilbert space, which solves a corresponding variational inequality. Furthermore, we propose explicit iterative schemes for finding the approximate minimizer of a constrained convex minimization problem and prove that the sequences generated by our schemes converge strongly to a solution of the constrained convex minimization problem. Our results improve and generalize some known results in the current literature. MSC:47H10, 37C25.

Highlights

  • A viscosity approximation method for finding fixed points of nonexpansive mappings was first proposed by Moudafi in [ ]

  • In, Xu [ ] proved the strong convergence of the sequence generated by the viscosity approximation method to a unique solution of a certain variational inequality problem defined on the set of fixed points of a nonexpansive map

  • The purpose of this paper is to introduce a general algorithm to approximate common fixed points for a countable family of nonexpansive mappings in a real Hilbert space

Read more

Summary

Introduction

A viscosity approximation method for finding fixed points of nonexpansive mappings was first proposed by Moudafi in [ ]. In , Xu [ ] proved the strong convergence of the sequence generated by the viscosity approximation method to a unique solution of a certain variational inequality problem defined on the set of fixed points of a nonexpansive map. In , Xu [ ] introduced an iterative method for computing the approximate solutions of a quadratic minimization problem over the set of fixed points of a nonexpansive mapping defined on a real Hilbert space. He proved that the sequence generated by the proposed method converges strongly to the unique solution of the quadratic minimization problem.

Tλ is a contraction provided μ
For a given arbitrary initial guess x
For each fixed λ
Suppose that
Note that the gradient
If the sequence
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.