IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v19y2021i1d10.1007_s10288-020-00440-3.html
   My bibliography  Save this article

Modified forward–backward splitting method for variational inclusions

Author

Listed:
  • Dang Hieu

    (Ton Duc Thang University)

  • Pham Ky Anh

    (Vietnam National University, Hanoi)

  • Le Dung Muu

    (Thang Long University)

Abstract

In this paper we propose an explicit algorithm for solving a variational inclusion problem of the sum of two operators, the one is maximally monotone and the other is monotone and Lipschitz continuous. The algorithm uses the variable stepsizes which are updated over each iteration by some cheap comptutations. These stepsizes are found without the prior knowledge of the Lipschitz constant of operator as well as without using lineseach procedure. The algorithm thus can be implemented easily. The convergence and the convergence rate of the algorithm are established under mild conditions. Several preliminary numerical results are provided to demonstrate the theoretical results and also to compare the new algorithm with some existing ones.

Suggested Citation

  • Dang Hieu & Pham Ky Anh & Le Dung Muu, 2021. "Modified forward–backward splitting method for variational inclusions," 4OR, Springer, vol. 19(1), pages 127-151, March.
    • Handle: RePEc:spr:aqjoor:v:19:y:2021:i:1:d:10.1007_s10288-020-00440-3
    DOI: 10.1007/s10288-020-00440-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-020-00440-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10288-020-00440-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dang Hieu & Pham Ky Anh & Le Dung Muu, 2017. "Modified hybrid projection methods for finding common solutions to variational inequality problems," Computational Optimization and Applications, Springer, vol. 66(1), pages 75-96, January.
    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. Timilehin O. Alakoya & Oluwatosin T. Mewomo & Yekini Shehu, 2022. "Strong convergence results for quasimonotone variational inequalities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(2), pages 249-279, April.
    2. Le Quang Thuy & Trinh Ngoc Hai, 2017. "A Projected Subgradient Algorithm for Bilevel Equilibrium Problems and Applications," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 411-431, November.
    3. Duong Viet Thong & Xiao-Huan Li & Vu Tien Dung & Pham Thi Huong Huyen & Hoang Thi Thanh Tam, 2024. "Using Double Inertial Steps Into the Single Projection Method with Non-monotonic Step Sizes for Solving Pseudomontone Variational Inequalities," Networks and Spatial Economics, Springer, vol. 24(1), pages 1-26, March.
    4. Xiaomei Dong & Xingju Cai & Deren Han & Zhili Ge, 2020. "Solving a Class of Variational Inequality Problems with a New Inexact Strategy," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-20, January.

    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:spr:aqjoor:v:19:y:2021:i:1:d:10.1007_s10288-020-00440-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.