Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. Iterative algorithms for finding a common solution of system of the set of variational inclusion problems and the set of fixed point problems
Loading...
Thumbnail Image

Iterative algorithms for finding a common solution of system of the set of variational inclusion problems and the set of fixed point problems

Author(s)
Kangtunyakarn, Atid
Date Issued
January 1, 2011
Type
Article
DOI
10.1186/1687-1812-2011-38
Abstract
In this article, we introduce a new mapping generated by infinite family of nonexpansive mapping and infinite real numbers. By means of the new mapping, we prove a strong convergence theorem for finding a common element of the set of fixed point problems of infinite family of nonexpansive mappings and the set of a finite family of variational inclusion problems in Hilbert space. In the last section, we apply our main result to prove a strong convergence theorem for finding a common element of the set of fixed point problems of infinite family of strictly pseudocontractive mappings and the set of finite family of variational inclusion problems. © 2011 Kangtunyakarn; licensee Springer.
Citation
Fixed Point Theory and Applications, 2011, 2011
Subjects

Fixed point

Nonexpansive mapping

Strict pseudo contrac...

Strongly positive ope...

Variational inclusion...

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback