IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2013y2013i1n218964.html

Algorithmic Approach to the Split Problems

Author

Listed:
  • Ming Ma

Abstract

This paper deals with design algorithms for the split variational inequality and equilibrium problems. Strong convergence theorems are demonstrated.

Suggested Citation

  • Ming Ma, 2013. "Algorithmic Approach to the Split Problems," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
  • Handle: RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:218964
    DOI: 10.1155/2013/218964
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/218964
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/218964?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. Yonghong Yao & Yeong-Cheng Liou & Naseer Shahzad, 2012. "A Strongly Convergent Method for the Split Feasibility Problem," Abstract and Applied Analysis, John Wiley & Sons, vol. 2012(1).
    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. Jinzuo Chen & Mihai Postolache & Li-Jun Zhu, 2019. "Iterative Algorithms for Split Common Fixed Point Problem Involved in Pseudo-Contractive Operators without Lipschitz Assumption," Mathematics, MDPI, vol. 7(9), pages 1-13, August.
    2. Chung-Chien Hong & Young-Ye Huang, 2014. "A Strong Convergence Algorithm for the Two‐Operator Split Common Fixed Point Problem in Hilbert Spaces," Abstract and Applied Analysis, John Wiley & Sons, vol. 2014(1).
    3. Young-Ye Huang & Chung-Chien Hong, 2013. "A Unified Iterative Treatment for Solutions of Problems of Split Feasibility and Equilibrium in Hilbert Spaces," Abstract and Applied Analysis, 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:jnlaaa:v:2013:y:2013:i:1:n:218964. 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/4058 .

    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.