{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T13:06:06Z","timestamp":1774098366207,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T00:00:00Z","timestamp":1624492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T00:00:00Z","timestamp":1624492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["CNPq-312559\/2019-4"],"award-info":[{"award-number":["CNPq-312559\/2019-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10957-021-01877-0","type":"journal-article","created":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T17:02:51Z","timestamp":1624554171000},"page":"183-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Strongly Convergent Proximal Point Method for Vector Optimization"],"prefix":"10.1007","volume":"190","author":[{"given":"Alfredo N.","family":"Iusem","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9659-5437","authenticated-orcid":false,"given":"Jefferson G.","family":"Melo","sequence":"additional","affiliation":[]},{"given":"Ray G.","family":"Serra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,24]]},"reference":[{"issue":"2","key":"1877_CR1","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.26.2.248.10558","volume":"26","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Combettes, P.L.: A weak-to-strong convergence principle for Fej\u00e9r-monotone methods in Hilbert spaces. Math. Oper. Res. 26(2), 248\u2013264 (2001)","journal-title":"Math. Oper. Res."},{"key":"1877_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)"},{"issue":"4","key":"1877_CR3","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1137\/120866415","volume":"23","author":"JY Bello Cruz","year":"2013","unstructured":"Bello Cruz, J.Y.: A subgradient method for vector optimization problems. SIAM J. Optim. 23(4), 2169\u20132182 (2013)","journal-title":"SIAM J. Optim."},{"key":"1877_CR4","unstructured":"Bello Cruz, J.Y., D\u00edaz Mill\u00e1n, R. Phan, H. M.: Conditional extragradient algorithms for solving variational inequalities. Pac. J. Optim. 15(3),331\u2013357 (2019)"},{"issue":"10","key":"1877_CR5","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1080\/01630563.2011.590914","volume":"32","author":"JY Bello Cruz","year":"2011","unstructured":"Bello Cruz, J.Y., Iusem, A.N.: A strongly convergent method for nonsmooth convex minimization in Hilbert spaces. Numer. Funct. Anal. Optim. 32(10), 1009\u20131018 (2011)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"16","key":"1877_CR6","doi-asserted-by":"publisher","first-page":"5268","DOI":"10.1016\/j.na.2011.04.067","volume":"74","author":"JY Bello Cruz","year":"2011","unstructured":"Bello Cruz, J.Y., Lucambio P\u00e9rez, L.R., Melo, J.G.: Convergence of the projected gradient method for quasiconvex multiobjective optimization. Nonlinear Anal. 74(16), 5268\u20135273 (2011)","journal-title":"Nonlinear Anal."},{"issue":"2","key":"1877_CR7","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s10957-013-0300-1","volume":"162","author":"JY Bello Cruz","year":"2014","unstructured":"Bello Cruz, J.Y., Lucambio P\u00e9rez, L.R.: A subgradient-like algorithm for solving vector convex inequalities. J. Optim. Theory Appl. 162(2), 392\u2013404 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"1877_CR8","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2020.1800699","author":"JY Bello Cruz","year":"2020","unstructured":"Bello Cruz, J.Y., Melo, J.G., Serra, R.G.: A proximal gradient splitting method for solving convex vector optimization problems. Optimization (2020). https:\/\/doi.org\/10.1080\/02331934.2020.1800699","journal-title":"Optimization"},{"issue":"2","key":"1877_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/01630563.2015.1080271","volume":"37","author":"JY Bello Cruz","year":"2016","unstructured":"Bello Cruz, J.Y., Oliveira, W.D.: On weak and strong convergence of the projected gradient method for convex optimization in real Hilbert spaces. Numer. Funct. Anal. Optim. 37(2), 129\u2013144 (2016)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"1","key":"1877_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10957-018-1330-5","volume":"179","author":"GC Bento","year":"2018","unstructured":"Bento, G.C., Cruz Neto, J.X., Meireles, L.: Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds. J. Optim. Theory Appl. 179(1), 37\u201352 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1877_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s11228-014-0279-2","volume":"22","author":"GC Bento","year":"2014","unstructured":"Bento, G.C., Cruz Neto, J.X., Soubeyran, A.: A proximal point-type method for multicriteria optimization. Set-Valued Var. Anal. 22(3), 557\u2013573 (2014)","journal-title":"Set-Valued Var. Anal."},{"key":"1877_CR12","doi-asserted-by":"crossref","unstructured":"Bento, G.C., Cruz\u00a0Neto, J.X., L\u00f3pez, G., Soubeyran, A., Souza, J.C.O.: The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem. SIAM J. Optim. 28(2), 1104\u20131120 (2018)","DOI":"10.1137\/16M107534X"},{"issue":"1","key":"1877_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/s10957-011-9984-2","volume":"154","author":"GC Bento","year":"2012","unstructured":"Bento, G.C., Ferreira, O.P., Oliveira, P.R.: Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds. J. Optim. Theory Appl. 154(1), 88\u2013107 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1877_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.orl.2017.10.017","volume":"46","author":"GC Bento","year":"2018","unstructured":"Bento, G.C., Ferreira, O.P., Pereira, Y.: Proximal point method for vector optimization on Hadamard manifolds. Oper. Res. Lett. 46(1), 13\u201318 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1877_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s11590-017-1114-0","volume":"12","author":"GC Bento","year":"2018","unstructured":"Bento, G.C., Ferreira, O.P., Sousa Junior, V.L.: Proximal point method for a special class of nonconvex multiobjective optimization functions. Optim. Lett. 12(2), 311\u2013320 (2018)","journal-title":"Optim. Lett."},{"issue":"4","key":"1877_CR16","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1137\/S1052623403429093","volume":"15","author":"H Bonnel","year":"2005","unstructured":"Bonnel, H., Iusem, A.N., Svaiter, B.F.: Proximal methods in vector optimization. SIAM J. Optim. 15(4), 953\u2013970 (2005)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"1877_CR17","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1080\/02331934.2018.1440553","volume":"67","author":"R Bo\u0163","year":"2018","unstructured":"Bo\u0163, R., Grad, S.M.: Inertial forward-backward methods for solving vector optimization problems. Optimization 67(7), 959\u2013974 (2018)","journal-title":"Optimization"},{"issue":"4","key":"1877_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02761171","volume":"29","author":"H Brezis","year":"1978","unstructured":"Brezis, H., Lions, P.L.: Infinite Products of Resolvents. Israel J. Math. 29(4), 329\u2013345 (1978)","journal-title":"Israel J. Math."},{"issue":"2","key":"1877_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10957-010-9667-4","volume":"146","author":"LC Ceng","year":"2010","unstructured":"Ceng, L.C., Mordukhovich, B.S., Yao, J.C.: Hybrid approximate proximal method with auxiliary variational inequality for vector optimization. J. Optim. Theory Appl. 146(2), 267\u2013303 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"1877_CR20","doi-asserted-by":"crossref","unstructured":"Cruz\u00a0Neto, J.X., Da\u00a0Silva, G.J.P., Ferreira, O.P., Lopes, J.O.: A subgradient method for multiobjective optimization. Comput. Optim. Appl. 54(3), 461\u2013472 (2013)","DOI":"10.1007\/s10589-012-9494-7"},{"issue":"4","key":"1877_CR21","doi-asserted-by":"publisher","first-page":"2517","DOI":"10.1137\/18M1180633","volume":"29","author":"OP Ferreira","year":"2019","unstructured":"Ferreira, O.P., Louzeiro, M.S., Prudente, L.F.: Gradient method for optimization on Riemannian manifolds with lower bounded curvature. SIAM J. Optim. 29(4), 2517\u20132541 (2019)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1877_CR22","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1137\/08071692X","volume":"20","author":"J Fliege","year":"2009","unstructured":"Fliege, J., Gra\u00f1a Drummond, L.M., Svaiter, B.F.: Newton\u2019s method for multiobjective optimization. SIAM J. Optim. 20(2), 602\u2013626 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1877_CR23","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J Fliege","year":"2000","unstructured":"Fliege, J., Svaiter, B.F.: Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51(3), 479\u2013494 (2000)","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"1877_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0167-6377(01)00101-8","volume":"29","author":"O G\u00e1rciga","year":"2001","unstructured":"G\u00e1rciga, O., Iusem, A.N., Svaiter, B.F.: On the need for hybrid steps in hybrid proximal point methods. Oper. Res. Lett. 29(5), 217\u2013220 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1877_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:COAP.0000018877.86161.8b","volume":"28","author":"LM Gra\u00f1a Drummond","year":"2004","unstructured":"Gra\u00f1a Drummond, L.M., Iusem, A.N.: A projected gradient method for vector optimization problems. Comput. Optim. Appl. 28(1), 5\u201329 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"1877_CR26","doi-asserted-by":"crossref","unstructured":"Gra\u00f1a Drummond, L.M., Raupp, F.M.P., Svaiter, B.F.: A quadratically convergent Newton method for vector optimization. Optimization 63(5), 661\u2013677 (2014)","DOI":"10.1080\/02331934.2012.693082"},{"issue":"2","key":"1877_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.cam.2004.06.018","volume":"175","author":"LM Gra\u00f1a Drummond","year":"2005","unstructured":"Gra\u00f1a Drummond, L.M., Svaiter, B.F.: A steepest descent method for vector optimization. J. Comput. Appl. Math. 175(2), 395\u2013414 (2005)","journal-title":"J. Comput. Appl. Math."},{"key":"1877_CR28","volume-title":"Splitting Algorithms, Modern Operator Theory, and Applications","author":"SM Grad","year":"2019","unstructured":"Grad, S.M.: A survey on proximal point type algorithm for solving vector optimization problems. In: Bauschke, H., Burachik, R., Luke, D. (eds.) Splitting Algorithms, Modern Operator Theory, and Applications. Springer, Cham (2019)"},{"issue":"2","key":"1877_CR29","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O G\u00fcler","year":"1991","unstructured":"G\u00fcler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29(2), 403\u2013419 (1991)","journal-title":"SIAM J. Control Optim."},{"key":"1877_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex analysis and minimization algorithms I","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex analysis and minimization algorithms I, vol. 305. Springer-Verlag, Berlin (1993)"},{"issue":"2","key":"1877_CR31","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BF02760552","volume":"31","author":"PL Lions","year":"1978","unstructured":"Lions, P.L.: An Iterative Method for Solving Variational Inequality. Israel J. Math. 31(2), 204\u2013208 (1978)","journal-title":"Israel J. Math."},{"issue":"8","key":"1877_CR32","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1080\/00036811.2013.839781","volume":"93","author":"F Lu","year":"2014","unstructured":"Lu, F., Chen, C.R.: Newton-like methods for solving vector optimization problems. Appl. Anal. 93(8), 1567\u20131586 (2014)","journal-title":"Appl. Anal."},{"key":"1877_CR33","doi-asserted-by":"crossref","unstructured":"Luc, D.T.: Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 319. Springer-Verlag, Berlin (1989)","DOI":"10.1007\/978-3-642-50280-4"},{"issue":"3","key":"1877_CR34","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1137\/17M1126588","volume":"28","author":"LR Lucambio P\u00e9rez","year":"2018","unstructured":"Lucambio P\u00e9rez, L.R., Prudente, L.F.: Nonlinear conjugate gradient methods for vector optimization. SIAM J. Optim. 28(3), 2690\u20132720 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1877_CR35","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10957-012-0253-9","volume":"158","author":"M Marques Alves","year":"2013","unstructured":"Marques Alves, M., Melo, J.G.: Strong convergence in Hilbert spaces via $$\\Gamma $$-duality. J. Optim. Theory Appl. 158(2), 343\u2013362 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1877_CR36","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: Regularization of Variational Inequalities by Successive Approximations. Rev. Fran\u00e7aise de Inform. 4, 154\u2013159 (1970)","journal-title":"Rev. Fran\u00e7aise de Inform."},{"key":"1877_CR37","unstructured":"Martinet, B.: Algorithms for Solving Optimization and Minimax Problems. Habilitation \u00e0 diriger des recherches, Universit\u00e9 Joseph-Fourier - Grenoble I (1972). https:\/\/tel.archives-ouvertes.fr\/tel-00284255. Universit\u00e9 : Universit\u00e9 scientifique et m\u00e9dicale de Grenoble"},{"issue":"3","key":"1877_CR38","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Proximal algorithms. Found. Trends Optim."},{"issue":"1","key":"1877_CR39","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF01580138","volume":"5","author":"RT Rockafellar","year":"1973","unstructured":"Rockafellar, R.T.: A dual approach to solving nonlinear programming problems by unconstrained optimization. Math. Program. 5(1), 354\u2013373 (1973)","journal-title":"Math. Program."},{"issue":"5","key":"1877_CR40","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1877_CR41","first-page":"59","volume":"6","author":"M Solodov","year":"1999","unstructured":"Solodov, M., Svaiter, B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6(1), 59\u201370 (1999)","journal-title":"J. Convex Anal."},{"issue":"1","key":"1877_CR42","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s101079900113","volume":"87","author":"M Solodov","year":"2000","unstructured":"Solodov, M., Svaiter, B.F.: Forcing strong convergence of proximal point iterations in a hilbert space. Math. Program. 87(1), 189\u2013202 (2000)","journal-title":"Math. Program."},{"issue":"8\u20139","key":"1877_CR43","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1080\/02331934.2010.524217","volume":"60","author":"B Svaiter","year":"2011","unstructured":"Svaiter, B.: A new duality theory for mathematical programming. Optimization 60(8\u20139), 1209\u20131231 (2011)","journal-title":"Optimization"},{"issue":"2","key":"1877_CR44","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10589-018-0043-x","volume":"72","author":"H Tanabe","year":"2019","unstructured":"Tanabe, H., Fukuda, E.H., Yamashita, N.: Proximal gradient methods for multiobjective optimization and their applications. Comput. Optim. Appl. 72(2), 339\u2013361 (2019)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01877-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-021-01877-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01877-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T11:33:28Z","timestamp":1626089608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-021-01877-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,24]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1877"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01877-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,24]]},"assertion":[{"value":"12 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}