{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T18:36:09Z","timestamp":1778610969066,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP180100602"],"award-info":[{"award-number":["DP180100602"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["304666\/2021-1"],"award-info":[{"award-number":["304666\/2021-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The variational inequality problem in finite-dimensional Euclidean space is addressed in this paper, and two inexact variants of the extragradient method are proposed to solve it. Instead of computing exact projections on the constraint set, as in previous versions extragradient method, the proposed methods compute feasible inexact projections on the constraint set using a relative error criterion. The first version of the proposed method provided is a counterpart to the classic form of the extragradient method with constant steps. In order to establish its convergence we need to assume that the operator is pseudo-monotone and Lipschitz continuous, as in the standard approach. For the second version, instead of a fixed step size, the method presented finds a suitable step size in each iteration by performing a line search. Like the classical extragradient method, the proposed method does just two projections into the feasible set in each iteration. A full convergence analysis is provided, with no Lipschitz continuity assumption of the operator defining the variational inequality problem.<\/jats:p>","DOI":"10.1007\/s10589-024-00592-6","type":"journal-article","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T21:02:01Z","timestamp":1722027721000},"page":"459-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extragradient method with feasible inexact projection to variational inequality problem"],"prefix":"10.1007","volume":"89","author":[{"given":"R. D\u00edaz","family":"Mill\u00e1n","sequence":"first","affiliation":[]},{"given":"O. P.","family":"Ferreira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5290-8051","authenticated-orcid":false,"given":"J.","family":"Ugon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"issue":"12","key":"592_CR1","doi-asserted-by":"publisher","first-page":"3515","DOI":"10.1080\/02331934.2021.1902520","volume":"71","author":"AA Aguiar","year":"2022","unstructured":"Aguiar, A.A., Ferreira, O.P., Prudente, L.F.: Subgradient method with feasible inexact projections for constrained convex optimization problems. Optimization 71(12), 3515\u20133537 (2022). https:\/\/doi.org\/10.1080\/02331934.2021.1902520","journal-title":"Optimization"},{"key":"592_CR2","doi-asserted-by":"publisher","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC, Springer, New York, (2011). https:\/\/doi.org\/10.1007\/978-1-4419-9467-7.","DOI":"10.1007\/978-1-4419-9467-7"},{"issue":"2","key":"592_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s001860300327","volume":"59","author":"A Beck","year":"2004","unstructured":"Beck, A., Teboulle, M.: A conditional gradient method with linear rate of convergence for solving convex linear systems. Math. Methods Oper. Res. 59(2), 235\u2013247 (2004). https:\/\/doi.org\/10.1007\/s001860300327","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"592_CR4","first-page":"331","volume":"15","author":"J Bello-Cruz","year":"2019","unstructured":"Bello-Cruz, J.: Mill\u00e1n RD, Phan HM,: Conditional extragradient algorithms for solving variational inequalities. Pacific journal of optimization 15(3), 331\u2013357 (2019)","journal-title":"Pacific journal of optimization"},{"issue":"1\u20132","key":"592_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/01630560902735223","volume":"30","author":"JY Bello Cruz","year":"2009","unstructured":"Bello Cruz, J.Y., Iusem, A.N.: A strongly convergent direct method for monotone variational inequalities in Hilbert spaces. Numer. Funct. Anal. Optim. 30(1\u20132), 23\u201336 (2009). https:\/\/doi.org\/10.1080\/01630560902735223","journal-title":"Numer. Funct. Anal. Optim."},{"key":"592_CR6","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear programming, 2nd edn. Athena Scientific Optimization and Computation Series, Athena Scientific, Belmont, MA (1999)","edition":"2"},{"issue":"4","key":"592_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Inexact spectral projected gradient methods on convex sets. IMA J. Numer. Anal. 23(4), 539\u2013559 (2003). https:\/\/doi.org\/10.1093\/imanum\/23.4.539","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"592_CR8","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., et al.: Variable metric inexact line-search-based methods for nonsmooth optimization. SIAM J. Optim. 26(2), 891\u2013921 (2016). https:\/\/doi.org\/10.1137\/15M1019325","journal-title":"SIAM J. Optim."},{"issue":"5","key":"592_CR9","doi-asserted-by":"publisher","first-page":"2653","DOI":"10.1137\/080733437","volume":"20","author":"R Burachik","year":"2010","unstructured":"Burachik, R., Dutta, J.: Inexact proximal point methods for variational inequality problems. SIAM J. Optim. 20(5), 2653\u20132678 (2010). https:\/\/doi.org\/10.1137\/080733437","journal-title":"SIAM J. Optim."},{"key":"592_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s11228-019-00517-0","volume":"28","author":"R Burachik","year":"2020","unstructured":"Burachik, R., Mill\u00e1n, R.D.: A projection algorithm for non-monotone variational inequalities. Set-Valued Variational Anal. 28, 149\u2013166 (2020)","journal-title":"Set-Valued Variational Anal."},{"issue":"5","key":"592_CR11","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1137\/S0363012998339745","volume":"39","author":"RS Burachik","year":"2000","unstructured":"Burachik, R.S., Scheimberg, S.: A proximal point method for the variational inequality problem in banach spaces. SIAM J. Control. Optim. 39(5), 1633\u20131649 (2000). https:\/\/doi.org\/10.1137\/S0363012998339745","journal-title":"SIAM J. Control. Optim."},{"issue":"2","key":"592_CR12","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10957-010-9757-3","volume":"148","author":"Y Censor","year":"2011","unstructured":"Censor, Y., Gibali, A., Reich, S.: The subgradient extragradient method for solving variational inequalities in Hilbert space. J. Optim. Theory Appl. 148(2), 318\u2013335 (2011). https:\/\/doi.org\/10.1007\/s10957-010-9757-3","journal-title":"J. Optim. Theory Appl."},{"issue":"9","key":"592_CR13","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1080\/02331934.2010.539689","volume":"61","author":"Y Censor","year":"2012","unstructured":"Censor, Y., Gibali, A., Reich, S.: Extensions of korpelevich\u2019s extragradient method for the variational inequality problem in euclidean space. Optimization 61(9), 1119\u20131132 (2012). https:\/\/doi.org\/10.1080\/02331934.2010.539689","journal-title":"Optimization"},{"key":"592_CR14","doi-asserted-by":"publisher","unstructured":"Combettes, P.L.: Quasi-Fej\u00e9rian analysis of some optimization algorithms. In: Inherently parallel algorithms in feasibility and optimization and their applications (Haifa, 2000), Stud. Comput. Math., vol\u00a08. North-Holland, Amsterdam, pp. 115\u2013152 (2001). https:\/\/doi.org\/10.1016\/S1570-579X(01)80010-0","DOI":"10.1016\/S1570-579X(01)80010-0"},{"key":"592_CR15","doi-asserted-by":"crossref","unstructured":"Cruz, J.Y.B., D\u00edaz Mill\u00e1n, R.: A relaxed-projection splitting algorithm for variational inequalities in hilbert spaces. J. Global Optim. 65(3), 597\u2013614 (2016)","DOI":"10.1007\/s10898-015-0397-x"},{"key":"592_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10589-021-00293-4","volume":"80","author":"R D\u00edaz Mill\u00e1n","year":"2021","unstructured":"D\u00edaz Mill\u00e1n, R., Ferreira, O.P., Prudente, L.F.: Alternating conditional gradient method for convex feasibility problems. Comput. Optim. Appl. 80, 245\u2013269 (2021). https:\/\/doi.org\/10.1007\/s10589-021-00293-4","journal-title":"Comput. Optim. Appl."},{"key":"592_CR17","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10898-022-01264-7","volume":"86","author":"R D\u00edaz Mill\u00e1n","year":"2023","unstructured":"D\u00edaz Mill\u00e1n, R., Ferreira, O.P., Ugon, J.: Approximate douglas-rachford algorithm for two-sets convex feasibility problems. J. Global Optim. 86, 621\u2013636 (2023). https:\/\/doi.org\/10.1007\/s10898-022-01264-7","journal-title":"J. Global Optim."},{"key":"592_CR18","doi-asserted-by":"crossref","unstructured":"Facchinei, F., Pang, J.S.: Finite-dimensional variational inequalities and complementarity problems. Vol. I. Springer Series in Operations Research, Springer-Verlag, New York (2003a)","DOI":"10.1007\/b97543"},{"key":"592_CR19","doi-asserted-by":"crossref","unstructured":"Facchinei, F., Pang, J.S.: Finite-dimensional variational inequalities and complementarity problems. Vol. II. Springer Series in Operations Research, Springer-Verlag, New York (2003b)","DOI":"10.1007\/b97544"},{"issue":"1","key":"592_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10589-021-00331-1","volume":"81","author":"OP Ferreira","year":"2022","unstructured":"Ferreira, O.P., Lemes, M., Prudente, L.F.: On the inexact scaled gradient projection method. Comput. Optim. Appl. 81(1), 91\u2013125 (2022). https:\/\/doi.org\/10.1007\/s10589-021-00331-1","journal-title":"Comput. Optim. Appl."},{"key":"592_CR21","unstructured":"Garber, D., Hazan, E.: Faster rates for the frank-wolfe method over strongly-convex sets. Proceedings of the 32Nd International Conference on International Conference on Machine Learning - Volume 37 pp. 541\u2013549 (2015). http:\/\/dl.acm.org\/citation.cfm?id=3045118.3045177"},{"issue":"10","key":"592_CR22","doi-asserted-by":"publisher","first-page":"6707","DOI":"10.1109\/TIT.2018.2841379","volume":"64","author":"M Golbabaee","year":"2018","unstructured":"Golbabaee, M., Davies, M.E.: Inexact gradient projection and fast data driven compressed sensing. IEEE Trans Inform Theory 64(10), 6707\u20136721 (2018)","journal-title":"IEEE Trans Inform Theory"},{"key":"592_CR23","doi-asserted-by":"publisher","unstructured":"Gon\u00e7alves, D.S., Gon\u00e7alves, M.L.N., Menezes, T.C.: Inexact variable metric method for convex-constrained optimization problems. Optimization, 1\u201319 (2021). https:\/\/doi.org\/10.1080\/02331934.2021.1887181","DOI":"10.1080\/02331934.2021.1887181"},{"key":"592_CR24","doi-asserted-by":"publisher","unstructured":"Iusem, A.N., Svaiter, B.F.: A variant of Korpelevich\u2019s method for variational inequalities with a new search strategy. Optimization 42(4), 309\u2013321 (1997). https:\/\/doi.org\/10.1080\/02331939708844365","DOI":"10.1080\/02331939708844365"},{"key":"592_CR25","unstructured":"Jaggi, M.: Revisiting frank-wolfe: Projection-free sparse convex optimization. Proceedings of the 30th International Conference on International Conference on Machine Learning - Volume 28 ICML\u201913:I\u2013427\u2013I\u2013435 (2013). http:\/\/dl.acm.org\/citation.cfm?id=3042817.3042867"},{"key":"592_CR26","doi-asserted-by":"crossref","unstructured":"Konnov, I.V.: A Class of Combined Iterative Methods for Solving Variational Inequalities. J. Optim. Theory Appl. 94(3), 677\u2013693 (1997)","DOI":"10.1023\/A:1022605117998"},{"issue":"4","key":"592_CR27","first-page":"747","volume":"12","author":"GM Korpelevi\u010d","year":"1976","unstructured":"Korpelevi\u010d, G.M.: An extragradient method for finding saddle points and for other problems. \u00c8konom i Mat Metody 12(4), 747\u2013756 (1976)","journal-title":"\u00c8konom i Mat Metody"},{"issue":"1","key":"592_CR28","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/14097238X","volume":"25","author":"Y Malitsky","year":"2015","unstructured":"Malitsky, Y.: Projected reflected gradient methods for monotone variational inequalities. SIAM J. Optim. 25(1), 502\u2013520 (2015). https:\/\/doi.org\/10.1137\/14097238X","journal-title":"SIAM J. Optim."},{"issue":"1","key":"592_CR29","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1080\/10556788.2017.1300899","volume":"33","author":"Y Malitsky","year":"2018","unstructured":"Malitsky, Y.: Proximal extrapolated gradient methods for variational inequalities. Optim Methods Softw 33(1), 140\u2013164 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1300899","journal-title":"Optim Methods Softw"},{"issue":"1\u20132","key":"592_CR30","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10107-019-01416-w","volume":"184","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y.: Golden ratio algorithms for variational inequalities. Math. Program. 184(1\u20132), 383\u2013410 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01416-w","journal-title":"Math. Program."},{"key":"592_CR31","doi-asserted-by":"publisher","unstructured":"Malitsky, Y.V., Semenov, V.V.: An extragradient algorithm for monotone variational inequalities. Cybernet Systems Anal 50(2), 271\u2013277 (2014). https:\/\/doi.org\/10.1007\/s10559-014-9614-8, translation of Kibernet. Sistem. Anal. 2014, no. 2, 125\u2013131","DOI":"10.1007\/s10559-014-9614-8"},{"issue":"1","key":"592_CR32","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10898-014-0150-x","volume":"61","author":"YV Malitsky","year":"2015","unstructured":"Malitsky, Y.V., Semenov, V.V.: A hybrid method without extrapolation step for solving variational inequality problems. J. Global Optim. 61(1), 193\u2013202 (2015). https:\/\/doi.org\/10.1007\/s10898-014-0150-x","journal-title":"J. Global Optim."},{"issue":"1","key":"592_CR33","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10589-018-0040-0","volume":"72","author":"FR de Oliveira","year":"2019","unstructured":"de Oliveira, F.R., Ferreira, O.P., Silva, G.N.: Newton\u2019s method with feasible inexact projections for solving constrained generalized equations. Comput. Optim. Appl. 72(1), 159\u2013177 (2019). https:\/\/doi.org\/10.1007\/s10589-018-0040-0","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"592_CR34","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10589-020-00186-y","volume":"76","author":"J Rasch","year":"2020","unstructured":"Rasch, J., Chambolle, A.: Inexact first-order primal-dual algorithms. Comput. Optim. Appl. 76(2), 381\u2013430 (2020). https:\/\/doi.org\/10.1007\/s10589-020-00186-y","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"592_CR35","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 19(4), 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"issue":"3","key":"592_CR36","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1137\/S0363012997317475","volume":"37","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A new projection method for variational inequality problems. SIAM J. Control. Optim. 37(3), 765\u2013776 (1999). https:\/\/doi.org\/10.1137\/S0363012997317475","journal-title":"SIAM J. Control. Optim."},{"issue":"5","key":"592_CR37","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1137\/S0363012994268655","volume":"34","author":"MV Solodov","year":"1996","unstructured":"Solodov, M.V., Tseng, P.: Modified projection-type methods for monotone variational inequalities. SIAM J. Control. Optim. 34(5), 1814\u20131830 (1996). https:\/\/doi.org\/10.1137\/S0363012994268655","journal-title":"SIAM J. Control. Optim."},{"issue":"1","key":"592_CR38","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1080\/02331934.2017.1377199","volume":"67","author":"DV Thong","year":"2018","unstructured":"Thong, D.V., Hieu, D.V.: Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems. Optimization 67(1), 83\u2013102 (2018). https:\/\/doi.org\/10.1080\/02331934.2017.1377199","journal-title":"Optimization"},{"issue":"2","key":"592_CR39","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0363012998338806","volume":"38","author":"P Tseng","year":"2000","unstructured":"Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control. Optim. 38(2), 431\u2013446 (2000). https:\/\/doi.org\/10.1137\/S0363012998338806","journal-title":"SIAM J. Control. Optim."},{"issue":"3","key":"592_CR40","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., et al.: Accelerated and inexact forward-backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013). https:\/\/doi.org\/10.1137\/110844805","journal-title":"SIAM J. Optim."},{"issue":"1","key":"592_CR41","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/B:JOTA.0000005047.30026.b8","volume":"119","author":"YJ Wang","year":"2003","unstructured":"Wang, Y.J., Xiu, N.H., Zhang, J.Z.: Modified extragradient method for variational inequalities and verification of solution existence. J. Optim. Theory Appl. 119(1), 167\u2013183 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"592_CR42","doi-asserted-by":"crossref","unstructured":"Ye, M., He, Y.: A double projection method for solving variational inequalities without monotonicity. Comput. Optim. Appl. 60(1), 141\u2013150 (2015)","DOI":"10.1007\/s10589-014-9659-7"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00592-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00592-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00592-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T12:12:40Z","timestamp":1728389560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00592-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,26]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["592"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00592-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,26]]},"assertion":[{"value":"19 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}