{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:34:06Z","timestamp":1762504446405,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003500","name":"Universit\u00e0 degli Studi di Padova","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003500","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we consider stochastic weakly convex optimization problems, however without the existence of a stochastic subgradient oracle. We present a derivative free algorithm that uses a two point approximation for computing a gradient estimate of the smoothed function. We prove convergence at a similar rate as state of the art methods, however with a larger constant, and report some numerical results showing the effectiveness of the approach.<\/jats:p>","DOI":"10.1007\/s10589-021-00313-3","type":"journal-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T06:02:43Z","timestamp":1630476163000},"page":"731-753","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A zeroth order method for stochastic weakly convex optimization"],"prefix":"10.1007","volume":"80","author":[{"given":"V.","family":"Kungurtsev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8978-6027","authenticated-orcid":false,"given":"F.","family":"Rinaldi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"key":"313_CR1","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, vol. 317. Springer, Berlin (2009)"},{"issue":"1","key":"313_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"313_CR3","doi-asserted-by":"publisher","first-page":"1908","DOI":"10.1137\/17M1151031","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Grimmer, B.: Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems. SIAM J. Optim. 29(3), 1908\u20131930 (2019)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"313_CR4","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1137\/17M1135086","volume":"28","author":"JC Duchi","year":"2018","unstructured":"Duchi, J.C., Ruan, F.: Stochastic methods for composite and weakly convex optimization problems. SIAM J. Optim. 28(4), 3229\u20133259 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"313_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10479-015-2019-x","volume":"240","author":"S Amaran","year":"2016","unstructured":"Amaran, S., Sahinidis, N.V., Sharda, B., Bury, S.J.: Simulation optimization: a review of algorithms and applications. Ann. Oper. Res. 240(1), 351\u2013380 (2016)","journal-title":"Ann. Oper. Res."},{"key":"313_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S. M.: Derivative-free optimization methods. Acta Numer. 28, 287\u2013404 (2019)","journal-title":"Acta Numer."},{"issue":"2","key":"313_CR7","first-page":"92","volume":"1","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Cartis, C., Menickelly, M., Scheinberg, K.: Convergence rate analysis of a stochastic trust-region method via supermartingales. Inf. J. Optim. 1(2), 92\u2013119 (2019)","journal-title":"Inf. J. Optim."},{"issue":"2","key":"313_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10107-017-1141-8","volume":"169","author":"R Chen","year":"2018","unstructured":"Chen, R., Menickelly, M., Scheinberg, K.: Stochastic optimization using a trust-region method and random models. Math. Program. 169(2), 447\u2013487 (2018)","journal-title":"Math. Program."},{"issue":"5","key":"313_CR9","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":"3","key":"313_CR10","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-016-9827-z","volume":"64","author":"J Larson","year":"2016","unstructured":"Larson, J., Billups, S.C.: Stochastic derivative-free optimization using a trust region framework. Comput. Optim. Appl. 64(3), 619\u2013645 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"313_CR11","unstructured":"Clevert, D., Unterthiner, T., Hochreiter, S.: Fast and accurate deep network learning by exponential linear units (elus). (2015) arXiv preprint arXiv:1511.07289"},{"issue":"4","key":"313_CR12","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"313_CR13","unstructured":"Balasubramanian, K., Ghadimi, S.: Zeroth-order nonconvex stochastic optimization: Handling constraints, high-dimensionality, and saddle-points. pp 651\u2013676 (2019) arXiv preprint arXiv:1809.06474"},{"key":"313_CR14","unstructured":"Li, X., Zhu, Z., So, A.M., Lee, J.D.: Incremental methods for weakly convex optimization. (2019) arXiv preprint arXiv:1907.11687"},{"issue":"2","key":"313_CR15","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(2), 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"key":"313_CR16","unstructured":"Audet, C., Le\u00a0Digabel, S., Tribes, C., Rochon Montplaisir, V.: The NOMAD project. Software available at https:\/\/www.gerad.ca\/nomad\/"},{"key":"313_CR17","unstructured":"Audet, C., Le\u00a0Digabel, S., Tribes, C.: NOMAD user guide. Technical Report G-2009-37, Les cahiers du GERAD (2009)"},{"key":"313_CR18","unstructured":"Audet, C., Dzahini, K.J., Kokkolaras, M., Le Digabel, S.: Stomads: stochastic blackbox optimization using probabilistic estimates. (2019) arXiv preprint arXiv:1911.01012"},{"issue":"1","key":"313_CR19","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00313-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00313-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00313-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T17:37:42Z","timestamp":1637257062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00313-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["313"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00313-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,9,1]]},"assertion":[{"value":"19 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}