{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:10:23Z","timestamp":1742962223688,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030628666"},{"type":"electronic","value":"9783030628673"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62867-3_21","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T08:05:11Z","timestamp":1604563511000},"page":"287-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Adaptive Extraproximal Algorithm for the Equilibrium Problem in Hadamard Spaces"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7160-9994","authenticated-orcid":false,"given":"Yana","family":"Vedel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3280-8245","authenticated-orcid":false,"given":"Vladimir","family":"Semenov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"key":"21_CR1","volume-title":"Equilibrium Problems and Applications","author":"G Kassay","year":"2019","unstructured":"Kassay, G., Radulescu, V.D.: Equilibrium Problems and Applications. Academic Press, London (2019). xx+419 p"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1134\/S0965542507120044","volume":"37","author":"AS Antipin","year":"1997","unstructured":"Antipin, A.S.: Equilibrium programming: Proximal methods. Comput. Math. Math. Phys. 37, 1285\u20131296 (1997). https:\/\/doi.org\/10.1134\/S0965542507120044","journal-title":"Comput. Math. Math. Phys."},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Mastroeni, G.: On auxiliary principle for equilibrium problems. In: Daniele, P., et al. (eds.) Equilibrium Problems and Variational Models, pp. 289\u2013298. Kluwer Academic Publishers, Dordrecht (2003). https:\/\/doi.org\/10.1007\/978-1-4613-0239-1","DOI":"10.1007\/978-1-4613-0239-1"},{"key":"21_CR4","first-page":"117","volume":"6","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Hirstoaga, S.A.: Equilibrium programming in Hilbert spaces. J. Nonlinear Convex Anal. 6, 117\u2013136 (2005)","journal-title":"J. Nonlinear Convex Anal."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1080\/02331930601122876","volume":"57","author":"TD Quoc","year":"2008","unstructured":"Quoc, T.D., Muu, L.D., Hien, N.V.: Extragradient algorithms extended to equilibrium problems. Optimization 57, 749\u2013776 (2008). https:\/\/doi.org\/10.1080\/02331930601122876","journal-title":"Optimization"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10559-011-9343-1","volume":"47","author":"SI Lyashko","year":"2011","unstructured":"Lyashko, S.I., Semenov, V.V., Voitova, T.A.: Low-cost modification of Korpelevich\u2019s methods for monotone equilibrium problems. Cybernet. Syst. Anal. 47(4), 631\u2013639 (2011). https:\/\/doi.org\/10.1007\/s10559-011-9343-1","journal-title":"Cybernet. Syst. Anal."},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Semenov, V.V.: Strongly convergent algorithms for variational inequality problem over the set of solutions the equilibrium problems. In: Zgurovsky, M.Z., Sadovnichiy, V.A. (eds.) Continuous and Distributed Systems. Solid Mechanics and Its Applications, vol. 211, pp. 131\u2013146. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-03146-010","DOI":"10.1007\/978-3-319-03146-010"},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Lyashko, S.I., Semenov, V.V.: A new two-step proximal algorithm of solving the problem of equilibrium programming. In: Goldengorin, B. (ed.) Optimization and Its Applications in Control and Data Sciences. Springer Optimization and Its Applications, vol. 115, pp. 315\u2013325. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42056-110","DOI":"10.1007\/978-3-319-42056-110"},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Chabak, L., Semenov, V., Vedel, Y.: A new non-euclidean proximal method for equilibrium problems. In: Chertov, O., Mylovanov, T., Kondratenko, Y., Kacprzyk, J., Kreinovich V., Stefanuk V. (eds.) Recent Developments in Data Science and Intelligent Analysis of Information. ICDSIAI 2018. Advances in Intelligent Systems and Computing, vol. 836, pp. 50\u201358. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-97885-76","DOI":"10.1007\/978-3-319-97885-76"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jmaa.2011.11.001","volume":"388","author":"V Colao","year":"2012","unstructured":"Colao, V., Lopez, G., Marino, G., Martin-Marquez, V.: Equilibrium problems in Hadamard manifolds. J. Math. Anal. Appl. 388, 61\u201377 (2012). https:\/\/doi.org\/10.1016\/j.jmaa.2011.11.001","journal-title":"J. Math. Anal. Appl."},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Khatibzadeh H., Mohebbi V. Monotone and pseudo-monotone equilibrium problems in Hadamard spaces. J. Austr. Math. Soc. 1\u201323 (2019). https:\/\/doi.org\/10.1017\/S1446788719000041","DOI":"10.1017\/S1446788719000041"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Khatibzadeh, H., Mohebbi, V.: Approximating solutions of equilibrium problems in Hadamard spaces. Miskolc Math. Not. 20(1), 281\u2013297 (2019). https:\/\/doi.org\/10.18514\/MMN.2019.2361","DOI":"10.18514\/MMN.2019.2361"},{"key":"21_CR13","unstructured":"Kinderlehrer, D., Stampacchia, G.: An introduction to variational inequalities and their applications. Academic Press, New York (1980). Russian transl., Moscow: Mir, 1983. 256 p"},{"issue":"4","key":"21_CR14","first-page":"747","volume":"12","author":"GM Korpelevich","year":"1976","unstructured":"Korpelevich, G.M.: An extragradient method for finding saddle points and for other problems. Matecon. 12(4), 747\u2013756 (1976)","journal-title":"Matecon."},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence O(1\/T) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004). https:\/\/doi.org\/10.1137\/S1052623403425629","journal-title":"SIAM J. Optim."},{"key":"21_CR16","unstructured":"Bach, F., Levy, K.Y.: A universal algorithm for variational inequalities adaptive to smoothness and noise. arXiv preprint arXiv:1902.01637 (2019)"},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10559-019-00144-5","volume":"55","author":"SV Denisov","year":"2019","unstructured":"Denisov, S.V., Semenov, V.V., Stetsyuk, P.I.: Bregman extragradient method with monotone rule of step adjustment$$^*$$. Cybern. Syst. Anal. 55(3), 377\u2013383 (2019). https:\/\/doi.org\/10.1007\/s10559-019-00144-5","journal-title":"Cybern. Syst. Anal."},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.21538\/0134-4889-2019-25-2-185-197","volume":"25","author":"FS Stonyakin","year":"2019","unstructured":"Stonyakin, F.S.: On the adaptive proximal method for a class of variational inequalities and related problems. Trudy Inst. Mat. i Mekh. UrO RAN 25(2), 185\u2013197 (2019). https:\/\/doi.org\/10.21538\/0134-4889-2019-25-2-185-197","journal-title":"Trudy Inst. Mat. i Mekh. UrO RAN"},{"key":"21_CR19","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-030-38603-031","volume-title":"Optimization and Applications","author":"FS Stonyakin","year":"2020","unstructured":"Stonyakin, F.S., Vorontsova, E.A., Alkousa, M.S.: New version of mirror prox for variational inequalities with adaptation to inexactness. In: Ja\u0107imovi\u0107, M., Khachay, M., Malkova, V., Posypkin, M. (eds.) OPTIMA 2019. Communications in Computer and Information Science, vol. 1145, pp. 427\u2013442. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38603-031"},{"issue":"1","key":"21_CR20","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."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10957-005-7564-z","volume":"128","author":"N Nadezhkina","year":"2006","unstructured":"Nadezhkina, N., Takahashi, W.: Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings. J. Optim. Theory Appl. 128, 191\u2013201 (2006). https:\/\/doi.org\/10.1007\/s10957-005-7564-z","journal-title":"J. Optim. Theory Appl."},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s10957-012-0085-7","volume":"155","author":"PT Vuong","year":"2012","unstructured":"Vuong, P.T., Strodiot, J.J., Nguyen, V.H.: Extragradient methods and linesearch algorithms for solving Ky Fan inequalities and fixed point problems. J. Optim. Theory Appl. 155, 605\u2013627 (2012). https:\/\/doi.org\/10.1007\/s10957-012-0085-7","journal-title":"J. Optim. Theory Appl."},{"issue":"7","key":"21_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1615\/JAutomatInfScien.v47.i7.40","volume":"47","author":"DA Verlan","year":"2015","unstructured":"Verlan, D.A., Semenov, V.V., Chabak, L.M.: A strongly convergent modified extragradient method for variational inequalities with non-lipschitz operators. J. Autom. Inf. Sci. 47(7), 31\u201346 (2015). https:\/\/doi.org\/10.1615\/JAutomatInfScien.v47.i7.40","journal-title":"J. Autom. Inf. Sci."},{"issue":"8","key":"21_CR24","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1615\/JAutomatInfScien.v50.i8.30","volume":"50","author":"VV Semenov","year":"2018","unstructured":"Semenov, V.V.: Modified extragradient method with Bregman divergence for variational inequalities. J. Autom. Inf. Sci. 50(8), 26\u201337 (2018). https:\/\/doi.org\/10.1615\/JAutomatInfScien.v50.i8.30","journal-title":"J. Autom. Inf. Sci."},{"issue":"6","key":"21_CR25","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1615\/JAutomatInfScien.v51.i6.20","volume":"51","author":"SV Denisov","year":"2019","unstructured":"Denisov, S.V., Nomirovskii, D.A., Rublyov, B.V., Semenov, V.V.: Convergence of extragradient algorithm with monotone step size strategy for variational inequalities and operator equations. J. Autom. Inf. Sci. 51(6), 12\u201324 (2019). https:\/\/doi.org\/10.1615\/JAutomatInfScien.v51.i6.20","journal-title":"J. Autom. Inf. Sci."},{"issue":"5","key":"21_CR26","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/BF01141092","volume":"28","author":"LD Popov","year":"1980","unstructured":"Popov, L.D.: A modification of the Arrow-Hurwicz method for search of saddle points. Math. Not. Acad. Sci. USSR 28(5), 845\u2013848 (1980). https:\/\/doi.org\/10.1007\/BF01141092","journal-title":"Math. Not. Acad. Sci. USSR"},{"issue":"2","key":"21_CR27","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s10559-017-9923-9","volume":"53","author":"VV Semenov","year":"2017","unstructured":"Semenov, V.V.: A version of the mirror descent method to solve variational inequalities$$^*$$. Cybern. Syst. Anal. 53(2), 234\u2013243 (2017). https:\/\/doi.org\/10.1007\/s10559-017-9923-9","journal-title":"Cybern. Syst. Anal."},{"issue":"3","key":"21_CR28","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10559-019-00142-7","volume":"55","author":"DA Nomirovskii","year":"2019","unstructured":"Nomirovskii, D.A., Rublyov, B.V., Semenov, V.V.: Convergence of two-stage method with bregman divergence for solving variational inequalities$$^{*}$$. Cybern. Syst. Anal. 55(3), 359\u2013368 (2019). https:\/\/doi.org\/10.1007\/s10559-019-00142-7","journal-title":"Cybern. Syst. Anal."},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Bacak, M.: Convex Analysis and Optimization in Hadamard Spaces. De Gruyter, Berlin-Boston (2014). viii+185 p","DOI":"10.1515\/9783110361629"},{"key":"21_CR30","doi-asserted-by":"publisher","unstructured":"Kirk,W., Shahzad, N: Fixed Point Theory in Distance Spaces. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10927-5","DOI":"10.1007\/978-3-319-10927-5"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Burago, D., Burago, Yu., Ivanov, S.: A Course in Metric Geometry. Graduate Studies in Mathematics, vol. 33. AMS, Providence (2001). xiv+415 p","DOI":"10.1090\/gsm\/033"},{"key":"21_CR32","unstructured":"Gidel, G., Berard, H., Vincent, P., Lacoste-Julien, S.: A Variational Inequality Perspective on Generative Adversarial Networks. arXiv preprint arXiv:1802.10551 (2018)"},{"key":"21_CR33","unstructured":"Stonyakin, F., Gasnikov, A., Dvurechensky, P., Alkousa, M., Titov, A.: Generalized Mirror Prox for Monotone Variational Inequalities: Universality and Inexact Oracle. arXiv preprint arXiv:1806.05140 (2019)"},{"key":"21_CR34","unstructured":"Diakonikolas, J.: Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities. arXiv preprint arXiv:2002.08872 (2020)"}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62867-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:03:06Z","timestamp":1619265786000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62867-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030628666","9783030628673"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62867-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=optima-2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.23","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}