{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T09:40:27Z","timestamp":1742377227483,"version":"3.40.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"European Regional Development Fund and the Hungarian Government","award":["GINOP_PLUSZ-2.1.1-21-2022-00144","GINOP_PLUSZ-2.1.1-21-2022-00144"],"award-info":[{"award-number":["GINOP_PLUSZ-2.1.1-21-2022-00144","GINOP_PLUSZ-2.1.1-21-2022-00144"]}]},{"name":"European Regional Development Fund and the Hungarian Government","award":["GINOP_PLUSZ-2.1.1-21-2022-00144"],"award-info":[{"award-number":["GINOP_PLUSZ-2.1.1-21-2022-00144"]}]},{"name":"Ministry of Innovation and Technology of Hungary from the National Research, Development and Innovation Fund","award":["BME-NVA-02, financed under the TKP2021"],"award-info":[{"award-number":["BME-NVA-02, financed under the TKP2021"]}]},{"DOI":"10.13039\/100017588","name":"John von Neumann University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100017588","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":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Gradient computation of multivariate distribution functions calls for considerable effort. Hence coordinate descent and derivative-free approaches are attractive. This paper deals with constrained convex problems. We perform random descent steps in an approximation scheme that is an inexact cutting-plane method from a dual viewpoint. We prove that the scheme converges and present a computational study comparing different descent methods applied in the approximation scheme.<\/jats:p>","DOI":"10.1007\/s10957-025-02619-2","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T20:46:26Z","timestamp":1739911586000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Random Descent Steps in a Probability Maximization Scheme"],"prefix":"10.1007","volume":"205","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4397-1758","authenticated-orcid":false,"given":"Edit","family":"Csizm\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajmund","family":"Drenyovszki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Sz\u00e1ntai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba I.","family":"F\u00e1bi\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"key":"2619_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60, 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"2619_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ejor.2021.09.040","volume":"298","author":"E Butyn","year":"2022","unstructured":"Butyn, E., Karas, E., de Oliveira, W.: A derivative-free trust-region algorithm with copula-based models for probability maximization problems. Eur. J. Oper. Res. 298, 59\u201375 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"2619_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1049\/iet-gtd:20070280","volume":"2","author":"E Carpaneto","year":"2008","unstructured":"Carpaneto, E., Chicco, G.: Probabilistic characterisation of the aggregated residential load patterns. IET Gener. Tran. Distrib. 2, 373\u2013382 (2008)","journal-title":"IET Gener. Tran. Distrib."},{"key":"2619_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/00949658608810951","volume":"26","author":"I De\u00e1k","year":"1986","unstructured":"De\u00e1k, I.: Computing probabilities of rectangles in case of multinormal distribution. J. Stat. Comput. Simul. 26, 101\u2013114 (1986)","journal-title":"J. Stat. Comput. Simul."},{"key":"2619_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1023\/A:1019215116991","volume":"100","author":"I De\u00e1k","year":"2000","unstructured":"De\u00e1k, I.: Subroutines for computing normal probabilities of sets - computer experiences. Ann. Oper. Res. 100, 103\u2013122 (2000)","journal-title":"Ann. Oper. Res."},{"key":"2619_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s001860400371","volume":"60","author":"D Dentcheva","year":"2004","unstructured":"Dentcheva, D., Lai, B., Ruszczy\u0144ski, A.: Dual methods for probabilistic optimization problems. Math. Methods Oper. Res. 60, 331\u2013346 (2004)","journal-title":"Math. Methods Oper. Res."},{"key":"2619_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10107-012-0539-6","volume":"138","author":"D Dentcheva","year":"2013","unstructured":"Dentcheva, D., Martinez, G.: Regularization methods for optimization problems with probabilistic constraints. Math. Program. 138, 223\u2013251 (2013)","journal-title":"Math. Program."},{"key":"2619_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/PL00011393","volume":"89","author":"D Dentcheva","year":"2000","unstructured":"Dentcheva, D., Pr\u00e9kopa, A., Ruszczy\u0144ski, A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89, 55\u201377 (2000)","journal-title":"Math. Program."},{"key":"2619_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10100-020-00697-3","volume":"29","author":"CI F\u00e1bi\u00e1n","year":"2021","unstructured":"F\u00e1bi\u00e1n, C.I.: Gaining traction: on the convergence of an inner approximation scheme for probability maximization. CEJOR 29, 491\u2013519 (2021)","journal-title":"CEJOR"},{"unstructured":"F\u00e1bi\u00e1n, C.I., Csizm\u00e1s, E., Drenyovszki, R., van Ackooij, W., Vajnai, T., Kov\u00e1cs, L., Sz\u00e1ntai, T.: Probability maximization by inner approximation. Acta Polytechnica Hungarica 15, 105\u2013125 (2018). Special issue dedicated to the memory of Andr\u00e1s Pr\u00e9kopa (editors: A. Bak\u00f3, I. Maros and T. Sz\u00e1ntai)","key":"2619_CR10"},{"doi-asserted-by":"publisher","unstructured":"F\u00e1bi\u00e1n, C.I., Csizm\u00e1s, E., Drenyovszki, R., Vajnai, T., Kov\u00e1cs, L., Sz\u00e1ntai, T.: A randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming. Annals of Operations Research (2019). https:\/\/doi.org\/10.1007\/s10479-019-03143-z. To appear in S.I.: Stochastic Modeling and Optimization, in memory of Andr\u00e1s Pr\u00e9kopa (editors: E. Boros, M. Katehakis, A. Ruszczy\u0144ski). Open access","key":"2619_CR11","DOI":"10.1007\/s10479-019-03143-z"},{"key":"2619_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/10618600.1992.10477010","volume":"1","author":"A Genz","year":"1992","unstructured":"Genz, A.: Numerical computation of multivariate normal probabilities. J. Comput. Graph. Stat. 1, 141\u2013150 (1992)","journal-title":"J. Comput. Graph. Stat."},{"key":"2619_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0022-247X(91)90237-T","volume":"158","author":"G Gorni","year":"1991","unstructured":"Gorni, G.: Conjugation and second-order properties of convex functions. J. Math. Anal. Appl. 158, 293\u2013315 (1991)","journal-title":"J. Math. Anal. Appl."},{"key":"2619_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-018-1237-9","volume":"174","author":"A Hantoute","year":"2018","unstructured":"Hantoute, A., Henrion, R., P\u00e9rez-Aros, P.: Subdifferential characterization of probability functions under Gaussian distribution. Math. Program. 174, 167\u2013194 (2018)","journal-title":"Math. Program."},{"key":"2619_CR15","first-page":"285","volume":"16","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S., R\u00e9, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm. J. Mach. Learn. Res. 16, 285\u2013322 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"2619_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18842-3","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"2016","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. Springer International Publishing, Cham (2016)"},{"key":"2619_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Yu Nesterov","year":"2012","unstructured":"Nesterov, Yu.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22, 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"2619_CR18","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Yu Nesterov","year":"2017","unstructured":"Nesterov, Yu., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17, 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"key":"2619_CR19","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1287\/mnsc.9.3.405","volume":"9","author":"C Van de Panne","year":"1963","unstructured":"Van de Panne, C., Pop, W.: Minimum-cost cattle feed under probabilistic protein constraints. Manage. Sci. 9, 405\u2013430 (1963)","journal-title":"Manage. Sci."},{"key":"2619_CR20","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF01421551","volume":"34","author":"A Pr\u00e9kopa","year":"1990","unstructured":"Pr\u00e9kopa, A.: Dual method for a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution. ZOR - Methods Models Oper. Res. 34, 441\u2013461 (1990)","journal-title":"ZOR - Methods Models Oper. Res."},{"key":"2619_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa, A.: Stochastic Programming. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"2619_CR22","first-page":"369","volume-title":"Stochastic Programming","author":"A Pr\u00e9kopa","year":"1980","unstructured":"Pr\u00e9kopa, A., Ganczer, S., De\u00e1k, I., Patyi, K.: The STABIL stochastic programming model and its experimental application to the electrical energy sector of the Hungarian economy. In: Dempster, M. (ed.) Stochastic Programming, pp. 369\u2013385. Academic Press, London (1980)"},{"key":"2619_CR23","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-1-4757-2878-1_18","volume-title":"New Trends in Mathematical Programming","author":"A Pr\u00e9kopa","year":"1998","unstructured":"Pr\u00e9kopa, A., Vizv\u00e1ri, B., Badics, T.: Programming under probabilistic constraint with discrete random variable. In: Giannesi, F., Rapcs\u00e1k, T., Koml\u00f3si, S. (eds.) New Trends in Mathematical Programming, pp. 235\u2013255. Kluwer, Dordrecht (1998)"},{"key":"2619_CR24","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970). https:\/\/doi.org\/10.1515\/9781400873173"},{"key":"2619_CR25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841059","volume-title":"Nonlinear Optimization","author":"A Ruszczy\u0144ski","year":"2006","unstructured":"Ruszczy\u0144ski, A.: Nonlinear Optimization. Princeton University Press, Princeton (2006)"},{"doi-asserted-by":"crossref","unstructured":"Van Ackooij, W., Berge, V., de Oliveira, W., Sagastiz\u00e1bal, C.: Probabilistic optimization via approximate p-efficient points and bundle methods. Comput. Oper. Res. 77, 177\u2013193 (2017)","key":"2619_CR26","DOI":"10.1016\/j.cor.2016.08.002"},{"doi-asserted-by":"crossref","unstructured":"Van Ackooij, W., Henrion, R.: Gradient formulae for nonlinear probabilistic constraints with Gaussian and Gaussian-like distributions. SIAM J. Optim. 24, 1864\u20131889 (2014)","key":"2619_CR27","DOI":"10.1137\/130922689"},{"doi-asserted-by":"crossref","unstructured":"Van Ackooij, W., Malick, J.: Eventual convexity of probability constraints with elliptical distributions. Math. Program. 175, 1\u201327 (2019)","key":"2619_CR28","DOI":"10.1007\/s10107-018-1230-3"},{"key":"2619_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"S Wright","year":"2015","unstructured":"Wright, S.: Coordinate descent algorithms. Math. Program. 151, 3\u201334 (2015)","journal-title":"Math. Program."},{"unstructured":"Xingyu Zhou: On the Fenchel duality between strong convexity and Lipschitz continuous gradient. arXiv:1803.06573 [math.OC] (2018)","key":"2619_CR30"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02619-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02619-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02619-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T08:43:07Z","timestamp":1742373787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02619-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2619"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02619-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,2,18]]},"assertion":[{"value":"15 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}