{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T22:28:30Z","timestamp":1783031310264,"version":"3.54.6"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T00:00:00Z","timestamp":1630886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["M-2045"],"award-info":[{"award-number":["M-2045"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GR 3367\/4-1"],"award-info":[{"award-number":["GR 3367\/4-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008736","name":"Fondo de Fomento al Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["Iniciacion 11180320"],"award-info":[{"award-number":["Iniciacion 11180320"]}],"id":[{"id":"10.13039\/501100008736","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce and investigate a new generalized convexity notion for functions called prox-convexity. The proximity operator of such a function is single-valued and firmly nonexpansive. We provide examples of (strongly) quasiconvex, weakly convex, and DC (difference of convex) functions that are prox-convex, however none of these classes fully contains the one of prox-convex functions or is included into it. We show that the classical proximal point algorithm remains convergent when the convexity of the proper lower semicontinuous function to be minimized is relaxed to prox-convexity.<\/jats:p>","DOI":"10.1007\/s10898-021-01081-4","type":"journal-article","created":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T03:12:15Z","timestamp":1630897935000},"page":"313-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["An extension of the proximal point algorithm beyond convexity"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1139-7504","authenticated-orcid":false,"given":"Sorin-Mihai","family":"Grad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Felipe","family":"Lara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"1081_CR1","first-page":"699","volume":"26","author":"S Adly","year":"2019","unstructured":"Adly, S., Bourdin, L., Caubet, F.: On a decomposition formula for the proximal operator of the sum of two convex functions. J. Convex Anal. 26, 699\u2013718 (2019)","journal-title":"J. Convex Anal."},{"key":"1081_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJ Arag\u00f3n-Artacho","year":"2018","unstructured":"Arag\u00f3n-Artacho, F.J., Fleming, R.M.T., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Programm. 169, 95\u2013118 (2018)","journal-title":"Math. Programm."},{"key":"1081_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10957-018-1223-7","volume":"177","author":"S Al-Homidan","year":"2018","unstructured":"Al-Homidan, S., Hadjisavvas, N., Shaalan, L.: Transformation of quasiconvex functions to eliminate local minima. J. Optim. Theory Appl. 177, 93\u2013105 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"1081_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-018-1292-2","volume":"178","author":"S Banert","year":"2019","unstructured":"Banert, S., Bo\u0163, R.I.: A general double-proximal gradient algorithm for d.c. programming. Math. Programm. 178, 301\u2013326 (2019)","journal-title":"Math. Programm."},{"key":"1081_CR5","doi-asserted-by":"crossref","unstructured":"Bauschke, H. H., Combettes, P. L.: Convex Analysis and Monotone Operators Theory in Hilbert Spaces. CMS Books in Mathematics. Springer-Verlag, second edition (2017)","DOI":"10.1007\/978-3-319-48311-5_20"},{"key":"1081_CR6","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1080\/02331934.2017.1294592","volume":"66","author":"RI Bo\u0163","year":"2017","unstructured":"Bo\u0163, R.I., Csetnek, E.R.: Proximal-gradient algorithms for fractional programming. Optimization 66, 1383\u20131396 (2017)","journal-title":"Optimization"},{"key":"1081_CR7","volume-title":"Generalized convexity and optimization","author":"A Cambini","year":"2009","unstructured":"Cambini, A., Martein, L.: Generalized convexity and optimization. Springer-Verlag, Berlin-Heidelberg (2009)"},{"key":"1081_CR8","first-page":"83","volume":"2","author":"R Cambini","year":"2003","unstructured":"Cambini, R., Carosi, L.: Coercivity concepts and recession function in constrained problems. Int. J. Math. Sci. 2, 83\u201396 (2003)","journal-title":"Int. J. Math. Sci."},{"key":"1081_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.cam.2005.01.026","volume":"185","author":"Y Censor","year":"2006","unstructured":"Censor, Y., Segal, A.: Algorithms for the quasiconvex feasibility problem. J. Comput. Appl. Math. 185, 34\u201350 (2006)","journal-title":"J. Comput. Appl. Math."},{"key":"1081_CR10","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1137\/S0363012903427336","volume":"43","author":"PL Combettes","year":"2004","unstructured":"Combettes, P.L., Pennanen, T.: Proximal methods for cohypomonotone operators. SIAM J. Control Optim. 43, 731\u2013742 (2004)","journal-title":"SIAM J. Control Optim."},{"key":"1081_CR11","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1287\/moor.22.4.998","volume":"22","author":"JP Crouzeix","year":"1997","unstructured":"Crouzeix, J.P., Ferland, J.A., Z\u0103linescu, C.: $$\\alpha $$-convex sets and strong quasiconvexity. Math. Oper. Res. 22, 998\u20131022 (1997)","journal-title":"Math. Oper. Res."},{"key":"1081_CR12","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1080\/02331930902884273","volume":"59","author":"FGM Cunha","year":"2010","unstructured":"Cunha, F.G.M., da Cruz Neto, J.X., Oliveira, P.R.: A proximal point algorithm with a $$\\varphi $$-divergence for quasiconvex programming. Optimization 59, 777\u2013792 (2010)","journal-title":"Optimization"},{"key":"1081_CR13","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s10851-020-00951-y","volume":"62","author":"R Gribonval","year":"2020","unstructured":"Gribonval, R., Nikolova, M.: A characterization of proximity operators. J. Math. Imag. Vis. 62, 773\u2013789 (2020)","journal-title":"J. Math. Imag. Vis."},{"key":"1081_CR14","first-page":"523","volume":"78","author":"JM Guti\u00e9rrez","year":"1984","unstructured":"Guti\u00e9rrez, J.M.: Infragradientes y direcciones de decrecimiento. Rev. Real A Cad. C. Ex., Fis. Y Nat. Madrid 78, 523\u2013532 (1984)","journal-title":"Rev. Real A Cad. C. Ex., Fis. Y Nat. Madrid"},{"key":"1081_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/b101428","volume-title":"Handbook of generalized convexity and generalized monotonicity","author":"N Hadjisavvas","year":"2005","unstructured":"Hadjisavvas, N., Komlosi, S., Schaible, S.: Handbook of generalized convexity and generalized monotonicity. Springer-Verlag, Boston (2005)"},{"key":"1081_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0124-6","volume":"116","author":"W Hare","year":"2009","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: Computing proximal points of nonconvex functions. Math. Program. 116, 221\u2013258 (2009)","journal-title":"Math. Program."},{"key":"1081_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.3934\/jdg.2020005","volume":"7","author":"T Hoheisel","year":"2020","unstructured":"Hoheisel, T., Laborde, M., Oberman, A.: A regularization interpretation of the proximal point method for weakly convex functions. J. Dyn. Games 7, 79\u201396 (2020)","journal-title":"J. Dyn. Games"},{"key":"1081_CR18","first-page":"1080","volume":"13","author":"A Iusem","year":"2003","unstructured":"Iusem, A., Pennanen, T., Svaiter, B.F.: Inexact variants of the proximal point algorithm without monotonicity, SIAM. J. Optim. 13, 1080\u20131097 (2003)","journal-title":"J. Optim."},{"key":"1081_CR19","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10898-011-9752-8","volume":"52","author":"N Langenberg","year":"2012","unstructured":"Langenberg, N., Tichatschke, R.: Interior proximal methods for quasiconvex optimization. J. Global Optim. 52, 641\u2013661 (2012)","journal-title":"J. Global Optim."},{"key":"1081_CR20","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","volume":"158","author":"AS Lewis","year":"2016","unstructured":"Lewis, A.S., Wright, S.-J.: A proximal method for composite minimization. Math. Programm. 158, 501\u2013546 (2016)","journal-title":"Math. Programm."},{"key":"1081_CR21","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s40306-020-00363-5","volume":"45","author":"LD Muu","year":"2020","unstructured":"Muu, L.D., Quy, N.V.: Global optimization from concave minimization to concave mixed variational inequality. Acta Math. Vietnam. 45, 449\u2013462 (2020)","journal-title":"Acta Math. Vietnam."},{"key":"1081_CR22","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10898-007-9156-y","volume":"39","author":"S Pan","year":"2007","unstructured":"Pan, S., Chen, J.-S.: Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming. J. Global Optim. 39, 555\u2013575 (2007)","journal-title":"J. Global Optim."},{"key":"1081_CR23","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.ejor.2015.05.041","volume":"246","author":"EA Papa Quiroz","year":"2015","unstructured":"Papa Quiroz, E.A., Mallma Ramirez, L., Oliveira, P.R.: An inexact proximal method for quasiconvex minimization. Eur. J. Op. Res. 246, 721\u2013729 (2015)","journal-title":"Eur. J. Op. Res."},{"key":"1081_CR24","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/moor.27.1.170.331","volume":"27","author":"T Pennanen","year":"2002","unstructured":"Pennanen, T.: Local convergence of the proximal point algorithm and multiplier methods without monotonicity. Math. Op. Res. 27, 170\u2013191 (2002)","journal-title":"Math. Op. Res."},{"key":"1081_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF00938758","volume":"46","author":"F Plastria","year":"1985","unstructured":"Plastria, F.: Lower subdifferentiable functions and their minimization by cutting plane. J. Optim. Theory Appl. 46, 37\u201354 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"1081_CR26","doi-asserted-by":"crossref","unstructured":"Penot, J.P.: Are generalized derivatives useful for generalized convex functions? In: Crouzeix, J.P., et al. (eds.) Generalized convexity, pp. 3\u201360. Kluwer, Generalized Monotonicity (1998)","DOI":"10.1007\/978-1-4613-3341-8_1"},{"key":"1081_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/02331930008844469","volume":"47","author":"JP Penot","year":"2000","unstructured":"Penot, J.P.: What is quasiconvex analysis? Optimization 47, 35\u2013110 (2000)","journal-title":"Optimization"},{"key":"1081_CR28","first-page":"243","volume":"7","author":"JP Penot","year":"2000","unstructured":"Penot, J.P., Z\u0103linescu, C.: Elements of quasiconvex subdifferential calculus. J. Convex Anal. 7, 243\u2013269 (2000)","journal-title":"J. Convex Anal."},{"key":"1081_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-4068(82)90026-X","volume":"9","author":"JP Vial","year":"1982","unstructured":"Vial, J.P.: Strong convexity of sets and functions. J. Math. Econ. 9, 187\u2013205 (1982)","journal-title":"J. Math. Econ."},{"key":"1081_CR30","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/moor.8.2.231","volume":"8","author":"JP Vial","year":"1983","unstructured":"Vial, J.P.: Strong and weak convexity of sets and functions. Math. Op. Res. 8, 231\u2013259 (1983)","journal-title":"Math. Op. Res."},{"key":"1081_CR31","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1017\/S0334270000010961","volume":"40","author":"H Xu","year":"1999","unstructured":"Xu, H., Rubinov, A.M., Glover, B.M.: Strict lower subdifferentiability and applications. J. Aust. Math. Soc. Ser. B., Appl. Math. 40, 379\u2013391 (1999)","journal-title":"J. Aust. Math. Soc. Ser. B., Appl. Math."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01081-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01081-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01081-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T17:07:45Z","timestamp":1643821665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01081-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,6]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1081"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01081-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,6]]},"assertion":[{"value":"13 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no conflicts of interest or competing interests related to this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}