IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v171y2016i1d10.1007_s10957-016-0972-4.html
   My bibliography  Save this article

Convergence of One-Step Projected Gradient Methods for Variational Inequalities

Author

Listed:
  • P. E. Maingé

    (Université des antilles)

  • M. L. Gobinddass

    (Université de Guyane)

Abstract

In this paper, we revisit the numerical approach to some classical variational inequalities, with monotone and Lipschitz continuous mapping A, by means of a projected reflected gradient-type method. A main feature of the method is that it formally requires only one projection step onto the feasible set and one evaluation of the involved mapping per iteration. Contrary to what was done so far, we establish the convergence of the method in a more general setting that allows us to use varying step-sizes without any requirement of additional projections. A linear convergence rate is obtained, when A is assumed to be strongly monotone. Preliminary numerical experiments are also performed.

Suggested Citation

  • P. E. Maingé & M. L. Gobinddass, 2016. "Convergence of One-Step Projected Gradient Methods for Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 146-168, October.
    • Handle: RePEc:spr:joptap:v:171:y:2016:i:1:d:10.1007_s10957-016-0972-4
    DOI: 10.1007/s10957-016-0972-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-0972-4
    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/s10957-016-0972-4?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. Y. Censor & A. Gibali & S. Reich, 2011. "The Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Space," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 318-335, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhongming Wu & Min Li, 2019. "General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems," Computational Optimization and Applications, Springer, vol. 73(1), pages 129-158, May.
    2. Yonghong Yao & Mihai Postolache & Jen-Chih Yao, 2019. "Iterative Algorithms for Pseudomonotone Variational Inequalities and Fixed Point Problems of Pseudocontractive Operators," Mathematics, MDPI, vol. 7(12), pages 1-13, December.

    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. Dang Hieu, 2017. "New subgradient extragradient methods for common solutions to equilibrium problems," Computational Optimization and Applications, Springer, vol. 67(3), pages 571-594, July.
    2. Chinedu Izuchukwu & Yekini Shehu, 2021. "New Inertial Projection Methods for Solving Multivalued Variational Inequality Problems Beyond Monotonicity," Networks and Spatial Economics, Springer, vol. 21(2), pages 291-323, June.
    3. 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.
    4. Yekini Shehu & Olaniyi S. Iyiola & Duong Viet Thong & Nguyen Thi Cam Van, 2021. "An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(2), pages 213-242, April.
    5. Dang Hieu & Pham Ky Anh & Le Dung Muu, 2019. "Modified extragradient-like algorithms with new stepsizes for variational inequalities," Computational Optimization and Applications, Springer, vol. 73(3), pages 913-932, July.
    6. Boţ, R.I. & Csetnek, E.R. & Vuong, P.T., 2020. "The forward–backward–forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces," European Journal of Operational Research, Elsevier, vol. 287(1), pages 49-60.
    7. Seifu Endris Yimer & Poom Kumam & Anteneh Getachew Gebrie & Rabian Wangkeeree, 2019. "Inertial Method for Bilevel Variational Inequality Problems with Fixed Point and Minimizer Point Constraints," Mathematics, MDPI, vol. 7(9), pages 1-21, September.
    8. Trong Phong Nguyen & Edouard Pauwels & Emile Richard & Bruce W. Suter, 2018. "Extragradient Method in Optimization: Convergence and Complexity," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 137-162, January.
    9. Shamshad Husain & Mohammed Ahmed Osman Tom & Mubashshir U. Khairoowala & Mohd Furkan & Faizan Ahmad Khan, 2022. "Inertial Tseng Method for Solving the Variational Inequality Problem and Monotone Inclusion Problem in Real Hilbert Space," Mathematics, MDPI, vol. 10(17), pages 1-16, September.
    10. Tingting Cai & Dongmin Yu & Huanan Liu & Fengkai Gao, 2022. "RETRACTED: Computational Analysis of Variational Inequalities Using Mean Extra-Gradient Approach," Mathematics, MDPI, vol. 10(13), pages 1-14, July.
    11. Dang Hieu & Duong Viet Thong, 2018. "New extragradient-like algorithms for strongly pseudomonotone variational inequalities," Journal of Global Optimization, Springer, vol. 70(2), pages 385-399, February.
    12. Liya Liu & Xiaolong Qin & Jen-Chih Yao, 2020. "Strong Convergent Theorems Governed by Pseudo-Monotone Mappings," Mathematics, MDPI, vol. 8(8), pages 1-15, July.
    13. Lateef Olakunle Jolaoso & Adeolu Taiwo & Timilehin Opeyemi Alakoya & Oluwatosin Temitope Mewomo, 2020. "A Strong Convergence Theorem for Solving Pseudo-monotone Variational Inequalities Using Projection Methods," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 744-766, June.
    14. Lu-Chuan Ceng & Xiaolong Qin & Yekini Shehu & Jen-Chih Yao, 2019. "Mildly Inertial Subgradient Extragradient Method for Variational Inequalities Involving an Asymptotically Nonexpansive and Finitely Many Nonexpansive Mappings," Mathematics, MDPI, vol. 7(10), pages 1-19, September.
    15. A. J. Zaslavski, 2012. "The Extragradient Method for Solving Variational Inequalities in the Presence of Computational Errors," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 602-618, June.
    16. Q. L. Dong & Y. C. Tang & Y. J. Cho & Th. M. Rassias, 2018. "“Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem," Journal of Global Optimization, Springer, vol. 71(2), pages 341-360, June.
    17. Dang Van Hieu & Jean Jacques Strodiot & Le Dung Muu, 2020. "An Explicit Extragradient Algorithm for Solving Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 185(2), pages 476-503, May.
    18. Q. L. Dong & Y. J. Cho & L. L. Zhong & Th. M. Rassias, 2018. "Inertial projection and contraction algorithms for variational inequalities," Journal of Global Optimization, Springer, vol. 70(3), pages 687-704, March.
    19. Ming Tian & Meng-Ying Tong, 2019. "Extension and Application of the Yamada Iteration Algorithm in Hilbert Spaces," Mathematics, MDPI, vol. 7(3), pages 1-13, February.
    20. Rapeepan Kraikaew & Satit Saejung, 2014. "Strong Convergence of the Halpern Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 163(2), pages 399-412, November.

    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:joptap:v:171:y:2016:i:1:d:10.1007_s10957-016-0972-4. 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.