{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:02:31Z","timestamp":1771336951420,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031812408","type":"print"},{"value":"9783031812415","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_10","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:44:49Z","timestamp":1735652689000},"page":"136-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constrained Global Optimization by\u00a0Smoothing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3255-0405","authenticated-orcid":false,"given":"Vladimir","family":"Norkin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8876-2429","authenticated-orcid":false,"given":"Alois","family":"Pichler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6692-2162","authenticated-orcid":false,"given":"Anton","family":"Kozyriev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10898-019-00837-3","volume":"76","author":"O Ar\u0131kan","year":"2020","unstructured":"Ar\u0131kan, O., Burachik, R.S., Kaya, C.Y.: Steklov regularization and trajectory methods for univariate global optimization. J. Glob. Optim. 76, 91\u2013120 (2020)","journal-title":"J. Glob. Optim."},{"key":"10_CR2","volume-title":"Discontinuous Extremum Problems","author":"VD Batukhtin","year":"1995","unstructured":"Batukhtin, V.D., Mayboroda, L.A.: Discontinuous Extremum Problems. Gippokrat, St. Petersburg (1995). (In Russian)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF00940451","volume":"77","author":"V Batukhtin","year":"1993","unstructured":"Batukhtin, V.: On solving discontinuous extremal problems. J. Optim. Theory Appl. 77, 575\u2013589 (1993)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"issue":"1\u20132","key":"10_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10107-020-01536-8","volume":"189","author":"RS Burachik","year":"2021","unstructured":"Burachik, R.S., Kaya, C.Y.: Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials. Math. Program. 189(1\u20132), 187\u2013216 (2021)","journal-title":"Math. Program."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Burke, J.V., Curtis, F.E., Lewis, A.S., Overton, M.L., Sim\u00f5es, L.E.A.: Gradient sampling methods for nonsmooth optimization. In: Bagirov, A.M., et\u00a0al. (eds.) Numerical Nonsmooth Optimization, pp. 201\u2013225. Springer (2020)","DOI":"10.1007\/978-3-030-34910-3_6"},{"key":"10_CR7","unstructured":"Chagas, J.Q., Diehl, N.M., Guidolin, P.L.: Some properties for the Steklov averages. arXiv preprint arXiv:1707.06368 (2017)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and nonsmooth analysis. SIAM (1990)","DOI":"10.1137\/1.9781611971309"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Dolan, E.D., Mor\u00e9, J.J., Munson, T.S.: Benchmarking optimization software with cops 3.0. Tech. rep., Argonne National Lab., Argonne, IL (US) (2004)","DOI":"10.2172\/834714"},{"issue":"7","key":"10_CR10","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12(7), 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","volume":"61","author":"JC Duchi","year":"2015","unstructured":"Duchi, J.C., Jordan, M.I., Wainwright, M.J., Wibisono, A.: Optimal rates for zero-order convex optimization: the power of two function evaluations. IEEE Trans. Inf. Theory 61(5), 2788\u20132806 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BF02742069","volume":"34","author":"YM Ermol\u2019ev","year":"1998","unstructured":"Ermol\u2019ev, Y.M., Norkin, V.: Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization. Cybern. Syst. Anal. 34(2), 196\u2013215 (1998). https:\/\/doi.org\/10.1007\/BF02742069","journal-title":"Cybern. Syst. Anal."},{"key":"10_CR13","volume-title":"Methods of Stochastic Programming","author":"YM Ermoliev","year":"1976","unstructured":"Ermoliev, Y.M.: Methods of Stochastic Programming. Nauka, Moscow (1976)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/S0363012992238369","volume":"33","author":"YM Ermoliev","year":"1995","unstructured":"Ermoliev, Y.M., Norkin, V.I., Wets, R.J.B.: The minimization of semicontinuous functions: mollifier subgradients. SIAM J. Control. Optim. 33, 149\u2013167 (1995)","journal-title":"SIAM J. Control. Optim."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1023\/B:CASA.0000012091.84864.65","volume":"39","author":"YM Ermoliev","year":"2003","unstructured":"Ermoliev, Y.M., Norkin, V.: Solution of nonconvex nonsmooth stochastic optimization problems. Cybern. Syst. Anal. 39, 701\u2013715 (2003). https:\/\/doi.org\/10.1023\/B:CASA.0000012091.84864.65","journal-title":"Cybern. Syst. Anal."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Pardalos, P.M. (eds.): Encyclopedia of Optimization. Springer (2009)","DOI":"10.1007\/978-0-387-74759-0"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10589-021-00296-1","volume":"80","author":"G Galvan","year":"2021","unstructured":"Galvan, G., Sciandrone, M., Lucidi, S.: A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints. Comput. Optim. Appl. 80(1), 33\u201353 (2021). https:\/\/doi.org\/10.1007\/s10589-021-00296-1","journal-title":"Comput. Optim. Appl."},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Gel\u2019fand, I.M., Tsetlin, M.L.: Some methods of control for complex systems. Russ. Math. Surv. 17(1), 95\u2013117 (1962). https:\/\/doi.org\/10.1070\/rm1962v017n01abeh001124","DOI":"10.1070\/rm1962v017n01abeh001124"},{"key":"10_CR19","volume-title":"Stochastic Methods for Solving Nonsmooth Extremal Problems","author":"AM Gupal","year":"1979","unstructured":"Gupal, A.M.: Stochastic Methods for Solving Nonsmooth Extremal Problems. Naukova Dumka, Kyiv (1979). (in Russian)"},{"key":"10_CR20","unstructured":"Horst, R., Pardalos, P.M.: Handbook of Global Optimization, vol.\u00a02. Springer (2013)"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980v9 (2017). https:\/\/doi.org\/10.48550\/arXiv.1412.6980","DOI":"10.48550\/arXiv.1412.6980"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Knopov, P., Norkin, V.: Stochastic optimization methods for the stochastic storage process control. In: Blondin, M.J., et\u00a0al. (eds.) Intelligent Control and Smart Energy Management. Renewable Resources and Transportation, Springer Optimization and Its Applications, vol.\u00a0181, pp. 79\u2013111. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-030-84474-5_3","DOI":"10.1007\/978-3-030-84474-5_3"},{"key":"10_CR23","unstructured":"Mai, V., Johansson, M.: Convergence of a stochastic gradient method with momentum for non-smooth non-convex optimization. In: International Conference on Machine Learning, pp. 6630\u20136639. PMLR (2020)"},{"issue":"4","key":"10_CR24","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/BF00935008","volume":"43","author":"DQ Mayne","year":"1984","unstructured":"Mayne, D.Q., Polak, E.: Nondifferential optimization via adaptive smoothing. J. Optim. Theory Appl. 43(4), 601\u2013613 (1984)","journal-title":"J. Optim. Theory Appl."},{"key":"10_CR25","unstructured":"Mikhalevich, V.S., Gupal, A.M., Norkin, V.I.: Methods of Nonconvex Optimization. Nauka, Moscow (1987). (in Russian, English translation 2024: http:\/\/arxiv.org\/abs\/2406.10406)"},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"10_CR27","volume-title":"Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems","author":"A Nemirovsky","year":"1983","unstructured":"Nemirovsky, A., Yudin, D.: Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems. Wiley, New York (1983)"},{"issue":"2","key":"10_CR28","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate O(1\/k$$^2$$). Soviet Math. Dokl. 27(2), 372\u2013376 (1983)","journal-title":"Soviet Math. Dokl."},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17, 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Norkin, V.I.: A stochastic smoothing method for nonsmooth global optimization. Cybernetics and Computer Technologies pp. 5\u201314 (2020). https:\/\/doi.org\/10.34229\/2707-451X.20.1.1","DOI":"10.34229\/2707-451X.20.1.1"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Norkin, V.I.: The projective exact penalty method for general constrained optimization. Preprint (2022). https:\/\/optimization-online.org\/?p=20458","DOI":"10.15407\/dopovidi2022.04.023"},{"key":"10_CR32","unstructured":"Polyak, B.: Introduction to Optimization. Optimization Software (1987)"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational analysis. Grundlehren der mathematischen Wissenschaften, Springer, 1st ed. (1998), 3rd printing, Springer edn. (2009)","DOI":"10.1007\/978-3-642-02431-3"},{"issue":"7","key":"10_CR34","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1007\/s11590-020-01537-8","volume":"14","author":"A Ruszczy\u0144ski","year":"2020","unstructured":"Ruszczy\u0144ski, A.: Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization. Optimiz. Lett. 14(7), 1615\u20131625 (2020). https:\/\/doi.org\/10.1007\/s11590-020-01537-8","journal-title":"Optimiz. Lett."},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Deterministic Global Optimization. Springer, New York (2017). https:\/\/doi.org\/10.1007\/978-1-4939-7199-2","DOI":"10.1007\/978-1-4939-7199-2"},{"issue":"1","key":"10_CR36","first-page":"1703","volume":"18","author":"O Shamir","year":"2017","unstructured":"Shamir, O.: An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. J. Mach. Learn. Res. 18(1), 1703\u20131713 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"10_CR37","unstructured":"Stekloff, W.: Sur les expressions asymptotiques de certaines fonctions, d\u00e9finies par les \u00e9quations diff\u00e9rentielles lin\u00e9aires du second ordre, et leurs applications au probl\u00e9me du d\u00e9veloppement d\u2019une fonction arbitraire en s\u00e9ries proc\u00e9dant suivant les-dites fonctions. Communications de la Soci\u00e9t\u00e9 math\u00e9matique de Kharkow 10, 97\u2013199 (1907). http:\/\/mi.mathnet.ru\/eng\/khmo\/v10\/p97, (In French)"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Strongin, R.G., Sergeyev, Y.D.: Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht (2000). 3rd edn. By Springer (2014)","DOI":"10.1007\/978-1-4615-4677-1_9"}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:03:23Z","timestamp":1735653803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}