{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:00:29Z","timestamp":1774990829260,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/allerton.2019.8919772","type":"proceedings-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T04:23:39Z","timestamp":1575606219000},"page":"407-414","source":"Crossref","is-referenced-by-count":0,"title":["Cubic Regularized ADMM with Convergence to a Local Minimum in Non-convex Optimization"],"prefix":"10.1109","author":[{"given":"Zai","family":"Shi","sequence":"first","affiliation":[{"name":"The Ohio State University,Columbus,OH,USA,43210"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[{"name":"The Ohio State University,Columbus,OH,USA,43210"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","article-title":"NEON +: Accelerated gradient methods for extracting negative curvature for non-convex optimization","author":"xu","year":"2017","journal-title":"arXiv preprint arXiv 1712 01033"},{"key":"ref30","first-page":"1","article-title":"Global convergence of ADMM in nonconvex nonsmooth optimization","author":"wang","year":"2015","journal-title":"Journal of Scientific Computing"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.70"},{"key":"ref11","first-page":"797","article-title":"Escaping from saddle points-online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Conference on Learning Theory"},{"key":"ref12","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref13","article-title":"Gradient primal-dual algorithm converges to second-order stationary solutions for nonconvex distributed optimization","author":"hong","year":"2018","journal-title":"arXiv preprint arXiv 1802 08908"},{"key":"ref14","author":"horn","year":"1990","journal-title":"Matrix Analysis"},{"key":"ref15","article-title":"Perturbed proximal descent to escape saddle points for non-convex and non-smooth objective functions","author":"huang","year":"2019","journal-title":"arXiv preprint arXiv 1901 04217"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1561\/2200000058"},{"key":"ref18","article-title":"How to escape saddle points efficiently","author":"jin","year":"2017","journal-title":"arXiv preprint arXiv 1703 01362"},{"key":"ref19","article-title":"Accelerated gradient descent escapes saddle points faster than gradient descent","author":"jin","year":"2017","journal-title":"arXiv preprint arXiv 1711 11585"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541725"},{"key":"ref3","article-title":"Finding approximate local minima for nonconvex optimization in linear time","author":"agarwal","year":"2016","journal-title":"arXiv preprint arXiv 1611 01146"},{"key":"ref6","article-title":"Gradient descent efficiently finds the cubic-regularized non-convex newton step","author":"carmon","year":"2016","journal-title":"arXiv preprint arXiv 1612 00547"},{"key":"ref29","article-title":"Stochastic cubic regularization for fast nonconvex optimization","author":"tripuraneni","year":"2017","journal-title":"arXiv preprint arXiv 1711 03890"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref8","first-page":"192","article-title":"The loss surfaces of multilayer networks","author":"choromanska","year":"2015","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/17M1114296"},{"key":"ref2","year":"2018","journal-title":"Non-smooth Optimization"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1026-2"},{"key":"ref1","year":"0","journal-title":"Cubic regularized admm with convergence to a local minimum in non-convex optimization"},{"key":"ref20","article-title":"The power of normalization: Faster evasion of saddle points","author":"levy","year":"2016","journal-title":"arXiv preprint arXiv 1611 04831"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1561\/0600000058"},{"key":"ref21","article-title":"Linearized ADMM for non-convex non-smooth optimization with convergence analysis","author":"liu","year":"2017","journal-title":"arXiv preprint arXiv 1705 02502"},{"key":"ref24","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate O(1 \/k2)","volume":"269","author":"nesterov","year":"1983","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"ref26","article-title":"When are nonconvex problems not scary?","author":"sun","year":"2015","journal-title":"arXiv preprint arXiv 1510 06096"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87481-2_24"}],"event":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2019,9,24]]},"end":{"date-parts":[[2019,9,27]]}},"container-title":["2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8911248\/8919648\/08919772.pdf?arnumber=8919772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:51Z","timestamp":1774986711000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8919772\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/allerton.2019.8919772","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}