{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T00:03:40Z","timestamp":1756771420239,"version":"3.44.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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,5]]},"DOI":"10.1109\/icassp.2019.8683241","type":"proceedings-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T16:01:56Z","timestamp":1555516916000},"page":"5356-5360","source":"Crossref","is-referenced-by-count":2,"title":["Perturbed Projected Gradient Descent Converges to Approximate Second-order Points for Bound Constrained Nonconvex Problems"],"prefix":"10.1109","author":[{"given":"Songtao","family":"Lu","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Minnesota Twin Cities, Minneapolis, MN, 55455, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziping","family":"Zhao","sequence":"additional","affiliation":[{"name":"Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kejun","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, 32611, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyi","family":"Hong","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Minnesota Twin Cities, Minneapolis, MN, 55455, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1724","article-title":"How to escape saddle points efficiently","author":"jin","year":"2017","journal-title":"Proceedings of International Conference on Machine Learning (ICML)"},{"key":"ref11","article-title":"First-order stochastic algorithms for escaping from saddle points in almost linear time","author":"xu","year":"2018","journal-title":"Proceedings of Neural Information Processing Systems (NIPS)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682941"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2310059"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2876416"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/080729529"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-009-9240-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/17M1134329"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"ref4","article-title":"Theoretical insights into the optimization landscape of over-parameterized shallow neural networks","author":"soltanolkotabi","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref3","first-page":"586","article-title":"Deep learning without poor local minima","author":"kawaguchi","year":"2016","journal-title":"Proceedings of Neural Information Processing Systems (NIPS)"},{"key":"ref6","article-title":"When are nonconvex problems not scary?","author":"sun","year":"2015","journal-title":"Proceedings of NIPS Workshop on Nonconvex Optimization for Machine Learning Theory and Practice"},{"key":"ref5","first-page":"797","article-title":"Escaping from saddle points — online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Proceedings of the Annual Conference on Learning Theory (COLT)"},{"key":"ref8","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","author":"ge","year":"2017","journal-title":"Proceedings of International Conference on Machine Learning (ICML)"},{"key":"ref7","article-title":"A geometric analysis of phase retrieval","author":"sun","year":"2017","journal-title":"arXiv 1602 06664 [cs IT]"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2679687"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref9","first-page":"1246","article-title":"Gradient descent only converges to minimizers","author":"lee","year":"2016","journal-title":"Proceedings of the Annual Conference on Learning Theory (COLT)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"ref22","first-page":"1230","article-title":"A generic approach for escaping saddle points","author":"reddi","year":"2018","journal-title":"Proc Int Conf Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref21","article-title":"Gradient descent efficiently finds the cubic-regularized non-convex Newton step","author":"carmon","year":"2016","journal-title":"Proceedings of NIPS Workshop on Nonconvex Optimization for Machine Learning Theory and Practice"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref24"},{"key":"ref23","article-title":"Escaping saddle points in constrained optimization","author":"mokhtari","year":"2018","journal-title":"Proceedings of Neural Information Processing Systems (NIPS)"}],"event":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2019,5,12]]},"location":"Brighton, UK","end":{"date-parts":[[2019,5,17]]}},"container-title":["ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8671773\/8682151\/08683241.pdf?arnumber=8683241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T19:14:49Z","timestamp":1756754089000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8683241\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icassp.2019.8683241","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}