{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:46:20Z","timestamp":1761129980789,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T00:00:00Z","timestamp":1636070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T00:00:00Z","timestamp":1636070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["13-1-0021"],"award-info":[{"award-number":["13-1-0021"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["Lagrange"],"award-info":[{"award-number":["Lagrange"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2023032"],"award-info":[{"award-number":["2023032"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-21-1-2282"],"award-info":[{"award-number":["N00014-21-1-2282"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11590-021-01819-9","type":"journal-article","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T11:03:46Z","timestamp":1636110226000},"page":"1611-1631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Nonsmooth rank-one matrix factorization landscape"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2882-8697","authenticated-orcid":false,"given":"C\u00e9dric","family":"Josz","sequence":"first","affiliation":[]},{"given":"Lexiao","family":"Lai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,5]]},"reference":[{"key":"1819_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, B.\u00a0G., Sojoudi, S.: Global optimality guarantees for nonconvex unsupervised video segmentation. Annual Allerton Conference on Communication, Control, and Computing, (2019)","DOI":"10.1109\/ALLERTON.2019.8919697"},{"issue":"1","key":"1819_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0893-6080(89)90014-2","volume":"2","author":"P Baldi","year":"1989","unstructured":"Baldi, P., Hornik, K.: neural networks and principal component analysis: learning from examples without local minima. Neural Netw. 2(1), 53\u201358 (1989)","journal-title":"Neural Netw."},{"key":"1819_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-order methods in optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-order methods in optimization. SIAM, New Delhi (2017)"},{"key":"1819_CR4","unstructured":"Bertsimas, D., Cory-Wright, R., Pauphilet, J.: Solving large-scale sparse pca to certifiable (near) optimality. arXiv preprint arXiv:2005.05195, (2020)"},{"key":"1819_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2016.11.001","volume":"23","author":"T Bouwmans","year":"2017","unstructured":"Bouwmans, T., Sobral, A., Javed, S., Jung, S.K., Zahzah, E.-H.: Decomposition into low-rank plus additive matrices for background\/foreground separation: A review for a comparative evaluation with a large-scale dataset. Comput. Sci. Rev. 23, 1\u201371 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"5","key":"1819_CR6","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1137\/0331063","volume":"31","author":"JV Burke","year":"1993","unstructured":"Burke, J.V., Ferris, M.C.: Weak sharp minima in mathematical programming. SIAM J. Control Optim. 31(5), 1340\u20131359 (1993)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1819_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM (JACM) 58(3), 1\u201337 (2011)","journal-title":"J. ACM (JACM)"},{"issue":"5","key":"1819_CR8","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1819_CR9","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.\u00a0A., Willsky, A.\u00a0S.: Rank-sparsity incoherence for matrix decomposition. SIOPT, (2011)","DOI":"10.1137\/090761793"},{"key":"1819_CR10","doi-asserted-by":"crossref","unstructured":"Charisopoulos, V., Chen, Y., Davis, D., D\u00edaz, M., Ding, L., Drusvyatskiy, D.: Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence. Found. Comput. Math., pp. 1\u201389, 2021","DOI":"10.1007\/s10208-020-09490-9"},{"issue":"4","key":"1819_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MSP.2018.2821706","volume":"35","author":"Y Chen","year":"2018","unstructured":"Chen, Y., Chi, Y.: Harnessing structures in big data via guaranteed low-rank matrix estimation: Recent theory and fast algorithms via convex and nonconvex optimization. IEEE Signal Process. Mag. 35(4), 14\u201331 (2018)","journal-title":"IEEE Signal Process. Mag."},{"issue":"20","key":"1819_CR12","doi-asserted-by":"publisher","first-page":"5239","DOI":"10.1109\/TSP.2019.2937282","volume":"67","author":"Y Chi","year":"2019","unstructured":"Chi, Y., Lu, Y.M., Chen, Y.: Nonconvex optimization meets low-rank matrix factorization: an overview. IEEE Trans. Signal Process. 67(20), 5239\u20135269 (2019)","journal-title":"IEEE Trans. Signal Process."},{"key":"1819_CR13","doi-asserted-by":"crossref","unstructured":"Clarke, F.\u00a0H.: Optimization and nonsmooth analysis. SIAM Classics Appl. Math., 1990","DOI":"10.1137\/1.9781611971309"},{"key":"1819_CR14","unstructured":"Du, Simon\u00a0S., Hu, Wei, Lee, Jason\u00a0D.: Algorithmic regularization in learning deep homogeneous models: layers are automatically balanced. NeurIPS 2018, (2018)"},{"key":"1819_CR15","unstructured":"Fattahi, S., Sojoudi, S.: Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis. JMLR, 2020"},{"key":"1819_CR16","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.cosrev.2019.100204","volume":"35","author":"B Garcia-Garcia","year":"2020","unstructured":"Garcia-Garcia, B., Bouwmans, T., Silva, A.J.R.: Background subtraction in real applications: challenges, current models and future directions. Comput. Sci. Rev. 35, 100\u2013204 (2020)","journal-title":"Comput. Sci. Rev."},{"issue":"4","key":"1819_CR17","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1287\/moor.2017.0895","volume":"43","author":"Nicolas Gillis","year":"2018","unstructured":"Gillis, Nicolas, Vavasis, Stephen A.: On the complexity of robust PCA and l1-norm low-rank matrix approximation. Math. Op. Res. 43(4), 1072\u20131084 (2018)","journal-title":"Math. Op. Res."},{"key":"1819_CR18","doi-asserted-by":"crossref","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory, (2011)","DOI":"10.1109\/TIT.2011.2104999"},{"issue":"4","key":"1819_CR19","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.1137\/080722059","volume":"19","author":"AD Ioffe","year":"2009","unstructured":"Ioffe, A.D.: An invitation to tame optimization. SIAM J. Optim. 19(4), 1894\u20131917 (2009)","journal-title":"SIAM J. Optim."},{"key":"1819_CR20","doi-asserted-by":"crossref","unstructured":"Jain, P., Kar, P.: Non-convex optimization for machine learning. Found Trends Mach. Learn., (2017)","DOI":"10.1561\/9781680833690"},{"key":"1819_CR21","unstructured":"Josz, C., Ouyang, Y., Zhang, R.\u00a0Y., Lavaei, J., Sojoudi, S.: A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization. NeurIPS, (2018)"},{"key":"1819_CR22","doi-asserted-by":"crossref","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Comput. (2009)","DOI":"10.1109\/MC.2009.263"},{"key":"1819_CR23","unstructured":"Levy, O., Goldberg, Y.: Neural word embedding as implicit matrix factorization. NeurIPS, (2014)"},{"key":"1819_CR24","doi-asserted-by":"crossref","unstructured":"Li, X., Zhu, Z., Man-Cho So, A., Vidal, R.: Nonconvex robust low-rank matrix recovery. SIAM J. Optim. (2019)","DOI":"10.1137\/18M1224738"},{"key":"1819_CR25","unstructured":"Li, Xiao, Zhu, Zhihui, Man-Cho So, Anthony, Lee, Jason\u00a0D.: Incremental methods for weakly convex optimization. 12th Annual Workshop on Optimization for Machine Learning, (2020)"},{"key":"1819_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/9781316882177","volume-title":"Algorithmic aspects of machine learning","author":"A Moitra","year":"2018","unstructured":"Moitra, A.: Algorithmic aspects of machine learning. Cambridge University Press, Cambridge (2018)"},{"issue":"1","key":"1819_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Yu Nesterov","year":"2005","unstructured":"Nesterov, Yu.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"1819_CR28","doi-asserted-by":"publisher","first-page":"94215","DOI":"10.1109\/ACCESS.2019.2928130","volume":"7","author":"LT Nguyen","year":"2019","unstructured":"Nguyen, L.T., Kim, J., Shim, B.: Low-rank matrix completion: a contemporary survey. IEEE Access 7, 94215\u201394237 (2019)","journal-title":"IEEE Access"},{"key":"1819_CR29","unstructured":"Recht, B.: A simpler approach to matrix completion. JMLR, (2011)"},{"key":"1819_CR30","doi-asserted-by":"crossref","unstructured":"Seidenberg, A.: A new decision method for elementary algebra. Annals Math., 365\u2013374, (1954)","DOI":"10.2307\/1969640"},{"key":"1819_CR31","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A decision method for elementary algebra and geometry: prepared for publication with the assistance of JCC McKinsey. (1951)","DOI":"10.1525\/9780520348097"},{"key":"1819_CR32","unstructured":"Valavi, H., Liu, S., Ramadge, P.\u00a0J.: The landscape of matrix factorization revisited. AISTATS, (2020)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01819-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01819-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01819-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T11:20:22Z","timestamp":1654514422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01819-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,5]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1819"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01819-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,11,5]]},"assertion":[{"value":"8 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}