IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n280158.html

Convergence Theorems for Hierarchical Fixed Point Problems and Variational Inequalities

Author

Listed:
  • Ibrahim Karahan
  • Murat Ozdemir

Abstract

This paper deals with a modi fied iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under certain approximate assumptions of mappings and parameters. As a special case, this projection method solves some quadratic minimization problem. It should be noted that the proposed method can be regarded as a generalized version of Wang and Xu (2013), Ceng et al. (2011), Sahu et al. (2012), and many other authors.

Suggested Citation

  • Ibrahim Karahan & Murat Ozdemir, 2014. "Convergence Theorems for Hierarchical Fixed Point Problems and Variational Inequalities," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
  • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:280158
    DOI: 10.1155/2014/280158
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/280158
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/280158?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. D. R. Sahu & Shin Min Kang & Vidya Sagar, 2012. "Approximation of Common Fixed Points of a Sequence of Nearly Nonexpansive Mappings and Solutions of Variational Inequality Problems," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    2. D. R. Sahu & Shin Min Kang & Vidya Sagar, 2012. "Approximation of Common Fixed Points of a Sequence of Nearly Nonexpansive Mappings and Solutions of Variational Inequality Problems," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-12, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. De la Sen & E. Karapinar, 2013. "Best Proximity Points of Generalized Semicyclic Impulsive Self‐Mappings: Applications to Impulsive Differential and Difference Equations," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
    2. M. De la Sen, 2013. "Some Results on Fixed and Best Proximity Points of Precyclic Self‐Mappings," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:280158. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.