{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T09:20:43Z","timestamp":1777368043158,"version":"3.51.4"},"reference-count":50,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF 1740551"],"award-info":[{"award-number":["CCF 1740551"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 2047637"],"award-info":[{"award-number":["DMS 2047637"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 1651851"],"award-info":[{"award-number":["DMS 1651851"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1137\/21m1430868","type":"journal-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:09:46Z","timestamp":1660262986000},"page":"1958-1983","source":"Crossref","is-referenced-by-count":5,"title":["Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization"],"prefix":"10.1137","volume":"32","author":[{"given":"Damek","family":"Davis","sequence":"first","affiliation":[]},{"given":"Mateo","family":"D\u00edaz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5245-0458","authenticated-orcid":true,"given":"Dmitriy","family":"Drusvyatskiy","sequence":"additional","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01505-1"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055464"},{"key":"atypb3","first-page":"3873","volume-title":"Curran Associates","author":"Bhojanapalli S.","year":"2016"},{"key":"atypb4","volume-title":"Convex Analysis and Nonlinear Optimization. Theory and Examples","author":"Borwein J.","year":"2000"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0437-9_4"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/17M1114296"},{"key":"atypb7","first-page":"5985","volume-title":"Curran Associates","author":"Criscitiello C.","year":"2019"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/19M130563X"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1026-2"},{"key":"atypb10","first-page":"80","volume-title":"Proc. Mach. Learn. Res. (PMLR)","author":"Daneshmand H.","year":"2018"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/18M1178244"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-021-09516-w"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/15M1020770"},{"key":"atypb14","first-page":"1068","volume":"2017","author":"Du S. S.","year":"2017","journal-title":"Adv. Neural Inform. Process. Systems"},{"key":"atypb15","first-page":"67","volume-title":"North-Holland","author":"Fletcher R.","year":"1982"},{"key":"atypb16","first-page":"40","volume-title":"Proc. Mach. Learn. Res. (PMLR)","author":"Ge R.","year":"2015"},{"key":"atypb17","first-page":"1233","volume-title":"International Conference on Machine Learning","volume":"70","author":"Ge R.","year":"2017"},{"key":"atypb18","first-page":"2973","volume-title":"Curran Associates","author":"Ge R.","year":"2016"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-020-01713-x"},{"key":"atypb20","first-page":"99","volume-title":"Proc. Mach. Learn. Res. (PMLR)","author":"Harvey N. J.","year":"2019"},{"key":"atypb21","volume-title":"Simple and Optimal High-Probability Bounds for Strongly-Convex Stochastic Gradient Descent, preprint, arXiv:1909.00843","author":"Harvey N. J.","year":"2019"},{"key":"atypb22","volume-title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms, preprint, arXiv:2102.02837","author":"Huang M.","year":"2021"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-97-01726-1"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.4169\/amer.math.monthly.120.10.936"},{"key":"atypb25","first-page":"4901","volume":"31","author":"Jin C.","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1145\/3418526"},{"key":"atypb27","first-page":"75","volume-title":"Proc. Mach. Learn. Res. (PMLR)","author":"Jin C.","year":"2018"},{"key":"atypb28","first-page":"801","volume-title":"Curran Associates","author":"Kakade S. M.","year":"2008"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01374-3"},{"key":"atypb30","first-page":"49","volume-title":"Proc. Mach. Learn. Res. (PMLR)","author":"Lee J. D.","year":"2016"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494267127"},{"key":"atypb32","volume-title":"Advances in Neural Information Processing Systems 33","author":"Lu S.","year":"2020"},{"key":"atypb33","first-page":"3633","volume-title":"Curran Associates","author":"Mokhtari A.","year":"2018"},{"key":"atypb34","volume-title":"Grundlehren Math. Wiss. 330","author":"Mordukhovich B. S.","year":"2006"},{"key":"atypb35","volume-title":"Appl. Optim. 87","author":"Nesterov Y.","year":"2004"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"atypb37","volume-title":"Convergence to Second-Order Stationarity for Constrained Non-Convex Optimization, preprint, arXiv:1810.02024","author":"Nouiehed M.","year":"2018"},{"key":"atypb38","volume-title":"A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees, preprint, arXiv:2006.07925","author":"O'Neill M.","year":"2020"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drz074"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176990853"},{"key":"atypb41","first-page":"1571","volume-title":"International Machine Learning Society","author":"Rakhlin A.","year":"2012"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01362-7"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1137\/17M1134329"},{"key":"atypb45","volume-title":"When are Nonconvex Problems Not Scary?, https:\/\/arxiv.org\/abs\/1510.06096","author":"Sun J.","year":"2016"},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9365-9"},{"key":"atypb47","first-page":"7274","volume-title":"Curran Associates","author":"Sun Y.","year":"2019"},{"key":"atypb48","volume-title":"Advances in Neural Information Processing Systems 33","author":"Wang K.","year":"2020"},{"key":"atypb49","volume-title":"Complexity of Projected Newton Methods for Bound-Constrained Optimization, preprint, arXiv:2103.15989","author":"Xie Y.","year":"2021"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3049171"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T15:09:01Z","timestamp":1664550541000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/21M1430868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,11]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["10.1137\/21M1430868"],"URL":"https:\/\/doi.org\/10.1137\/21m1430868","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,11]]}}}