{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T16:30:36Z","timestamp":1774542636010,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006394","name":"Air Force Materiel Command","doi-asserted-by":"publisher","award":["FA9550-18-1-0226"],"award-info":[{"award-number":["FA9550-18-1-0226"]}],"id":[{"id":"10.13039\/100006394","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006394","name":"Air Force Materiel Command","doi-asserted-by":"publisher","award":["FA9550-19-1-7026"],"award-info":[{"award-number":["FA9550-19-1-7026"]}],"id":[{"id":"10.13039\/100006394","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10957-021-01820-3","type":"journal-article","created":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T12:08:45Z","timestamp":1616501325000},"page":"341-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Quartic First-Order Methods for Low-Rank Minimization"],"prefix":"10.1007","volume":"189","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4600-7748","authenticated-orcid":false,"given":"Radu-Alexandru","family":"Dragomir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"d\u2019Aspremont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Bolte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"key":"1820_CR1","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact Matrix Completion Via Convex Optimization. Found Comput Math, 9(6), (2009)","DOI":"10.1007\/s10208-009-9045-5"},{"issue":"4","key":"1820_CR2","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"Jian-Feng Cai","year":"2010","unstructured":"Cai, Jian-Feng, Cand\u00e8s, Emmanuel J., Shen, Zuowei: A Singular Value Thresholding Algorithm for Matrix Completion. SIAM Journal on Optimization 20(4), 1956\u20131982 (2010)","journal-title":"SIAM Journal on Optimization"},{"key":"1820_CR3","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank Matrix Completion using Alternating Minimization. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, pages 665\u2014-674, (2013)","DOI":"10.1145\/2488608.2488693"},{"issue":"3","key":"1820_CR4","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"Benjamin Recht","year":"2007","unstructured":"Recht, Benjamin, Fazel, Maryam, Parrilo, Pablo A.: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization. SIAM Review 52(3), 471\u2013501 (2007)","journal-title":"SIAM Review"},{"key":"1820_CR5","doi-asserted-by":"crossref","unstructured":"Mishra, B., Meyer, G., Sepulchre, R.: Low-rank optimization for distance matrix completion. In Proceedings of the IEEE Conference on Decision and Control, pages 4455\u20134460, (2011)","DOI":"10.1109\/CDC.2011.6160810"},{"key":"1820_CR6","doi-asserted-by":"crossref","unstructured":"Fang, H.R., O\u2019Leary, D.P.: Euclidean distance matrix completion problems. Optimization Methods and Software, 27(4):695\u2013717, (2012)","DOI":"10.1080\/10556788.2011.643888"},{"issue":"4","key":"1820_CR7","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"61","author":"Emmanuel J Cand\u00e8s","year":"2015","unstructured":"Cand\u00e8s, Emmanuel J., Li, Xiaodong, Soltanolkotabi, Mahdi: Phase retrieval via wirtinger flow: Theory and algorithms. IEEE Transactions on Information Theory 61(4), 1985\u20132007 (2015)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1820_CR8","unstructured":"Chen, Y., Wainwright, M.J.: Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees. arXiv preprintarXiv:1509.03025, (2015)"},{"key":"1820_CR9","doi-asserted-by":"crossref","unstructured":"Burer, S., Monteiro, R.D.C.: Local Minima and Convergence in Low-Rank Semidefinite Programming. Mathematical Programming, 103(3):427\u2013444, (2005)","DOI":"10.1007\/s10107-004-0564-1"},{"key":"1820_CR10","unstructured":"Tu, S., Boczar, R., Simchowitz, M., Soltanolkotabi, M., Recht, B.: Low-rank Solutions of Linear Matrix Equations via Procrustes Flow. In Proceedings of the 33rd International Conference on International Conference on Machine Learning, pages 964\u2013973, (2016)"},{"key":"1820_CR11","unstructured":"Bhojanapalli, S.: Anastasios Kyrillidis, and Sujay Sanghavi. Dropping Convexity for Faster Semi-definite Optimization. JMLR: Workshop and Conference Proceedings, 40:1\u201353, (2016)"},{"key":"1820_CR12","first-page":"559","volume":"28","author":"Tuo Zhao","year":"2015","unstructured":"Zhao, Tuo, Wang, Zhaoran, Liu, Han: A Nonconvex Optimization Framework for Low Rank Matrix Estimation. Advances in Neural Information Processing Systems 28, 559\u2013567 (2015)","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"11","key":"1820_CR13","doi-asserted-by":"publisher","first-page":"6535","DOI":"10.1109\/TIT.2016.2598574","volume":"62","author":"Ruoyu Sun","year":"2016","unstructured":"Sun, Ruoyu, Luo, Zhi-Quan: Guaranteed Matrix Completion via Nonconvex Factorization. IEEE Transactions on Information Theory 62(11), 6535\u20136579 (2016)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1820_CR14","unstructured":"Zheng, Q., Lafferty, J.: Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent. arXiv preprintarXiv:1605.07051, (2016)"},{"key":"1820_CR15","unstructured":"Park, D., Kyrillidis, A.: Constantine Caramanis, and Sujay Sanghavi. Finding low-rank solutions to matrix problems , efficiently and provably. arXiv preprintarXiv:1606.03168v1, (2016)"},{"key":"1820_CR16","unstructured":"Zheng, Q., Lafferty, J.: A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements. In Advances in Neural Information Processing Systems 28, (2015)"},{"key":"1820_CR17","unstructured":"Ge, R., Lee, J.D., Ma, T.: Matrix Completion has No Spurious Local Minimum. Advances in Neural Information Processing Systems, pages 2973\u20132981, (2016)"},{"issue":"2","key":"1820_CR18","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"Heinz H Bauschke","year":"2017","unstructured":"Bauschke, Heinz H., Bolte, J\u00e9r\u00f4me, Teboulle, Marc: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications. Mathematics of Operations Research 42(2), 330\u2013348 (2017)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"1820_CR19","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1137\/17M1138558","volume":"28","author":"J\u00e9r\u00f4me Bolte","year":"2018","unstructured":"Bolte, J\u00e9r\u00f4me, Sabach, Shoham, Teboulle, Marc, Vaisbourd, Yakov: First order methods beyond convexity and lipschitz gradient continuity with applications to quadratic inverse problems. SIAM Journal on Optimization 28(3), 2131\u20132151 (2018)","journal-title":"SIAM Journal on Optimization"},{"key":"1820_CR20","doi-asserted-by":"crossref","unstructured":"Lin, C-J.: Projected Gradient Methods for Nonnegative Matrix Factorization. Neural Computation, (2007)","DOI":"10.1162\/neco.2007.19.10.2756"},{"issue":"3","key":"1820_CR21","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10013-016-0238-3","volume":"45","author":"Quang Van Nguyen","year":"2017","unstructured":"Van Nguyen, Quang: Forward-backward splitting with bregman distances. Vietnam Journal of Mathematics 45(3), 519\u2013539 (2017)","journal-title":"Vietnam Journal of Mathematics"},{"issue":"1","key":"1820_CR22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"Lu Haihao","year":"2018","unstructured":"Haihao, Lu, Freund, Robert M., Nesterov, Yurii: Relatively-Smooth Convex Optimization by First-Order Methods, and Applications. SIAM Journal on Optimization 28(1), 333\u2013354 (2018)","journal-title":"SIAM Journal on Optimization"},{"key":"1820_CR23","volume-title":"Introductory lectures on convex optimization: A basic course","author":"Yurii Nesterov","year":"2003","unstructured":"Nesterov, Yurii: Introductory lectures on convex optimization: A basic course. Springer, US (2003)"},{"issue":"3","key":"1820_CR24","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"Alfred Auslender","year":"2006","unstructured":"Auslender, Alfred, Teboulle, Marc: Interior gradient and proximal methods for convex and conic optimization. SIAM Journal on Optimization 16(3), 697\u2013725 (2006)","journal-title":"SIAM Journal on Optimization"},{"key":"1820_CR25","unstructured":"Hanzely, F., Richt, P., Xiao, L.: Accelerated Bregman proximal gradient methods for relatively smooth convex optimization. ArXiv preprintarXiv:1808.03045v1, (2018)"},{"key":"1820_CR26","unstructured":"Mukkamala, M.C., Ochs, P., Pock, T., Sabach, S.: Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Non-Convex Optimization. arXiv preprintarXiv:1904.03537, (2019)"},{"key":"1820_CR27","unstructured":"Meka, R., Jain, P., Dhillon, I.S.: Guaranteed Rank Minimization via Singular Value Projection. NIPS, (2010)"},{"key":"1820_CR28","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. CORE Report, (2007)"},{"issue":"4","key":"1820_CR29","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J\u00e9r\u00f4me Bolte","year":"2007","unstructured":"Bolte, J\u00e9r\u00f4me, Daniilidis, Aris, Lewis, Adrian: The \u0141ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems. SIAM Journal on Optimization 17(4), 1205\u20131223 (2007)","journal-title":"SIAM Journal on Optimization"},{"key":"1820_CR30","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., Simon, H.: On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering. In Proceedings of the 2005 SIAM ICDM, number\u00a04, pages 126\u2013135, (2005)","DOI":"10.1137\/1.9781611972757.70"},{"issue":"12","key":"1820_CR31","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TNN.2011.2169087","volume":"22","author":"Zhaoshui He","year":"2011","unstructured":"He, Zhaoshui, Xie, Shengli, Zdunek, Rafal, Zhou, Guoxu, Cichocki, Andrzej: Symmetric nonnegative matrix factorization: Algorithms and applications to probabilistic clustering. IEEE Transactions on Neural Networks 22(12), 2117\u20132131 (2011)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"3","key":"1820_CR32","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10898-014-0247-2","volume":"62","author":"Da Kuang","year":"2015","unstructured":"Kuang, Da, Yun, Sangwoon, Park, Haesun: SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering. Journal of Global Optimization 62(3), 545\u2013574 (2015)","journal-title":"Journal of Global Optimization"},{"issue":"6","key":"1820_CR33","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1137\/110821172","volume":"33","author":"Jingu Kim","year":"2013","unstructured":"Kim, Jingu, Park, Haesun: Fast Nonnegative Matrix Factorization: An Active-set-like Method and Comparisons. SIAM Journal on Scientific Computing 33(6), 3261\u20133281 (2013)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"1820_CR34","volume-title":"Fast local algorithms for large scale nonnegative matrix and tensor factorizations","author":"Andrzej Cichocki and Anh Huy Phan","year":"2009","unstructured":"Andrzej Cichocki and Anh Huy Phan: Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2009)"},{"issue":"21","key":"1820_CR35","doi-asserted-by":"publisher","first-page":"5571","DOI":"10.1109\/TSP.2016.2591510","volume":"64","author":"Arnaud Vandaele","year":"2016","unstructured":"Vandaele, Arnaud, Gillis, Nicolas, Lei, Qi, Zhong, Kai, Dhillon, Inderjit: Efficient and non-convex coordinate descent for symmetric nonnegative matrix factorization. IEEE Transactions on Signal Processing 64(21), 5571\u20135584 (2016)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"12","key":"1820_CR36","first-page":"2572","volume":"65","author":"Lu Songtao","year":"2017","unstructured":"Songtao, Lu, Hong, Mingyi, Wang, Zhengdao: A Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization : Convergence Analysis and Optimality. IEEE Transactions on Signal Processing 65(12), 2572\u20132576 (2017)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"1820_CR37","unstructured":"Zhu, Z., Li, X., Liu, K., Li, Q.: Dropping Symmetry for Fast Symmetric Nonnegative Matrix Factorization. In Advances in Neural Information Processing Systems 31, (2018)"},{"issue":"1","key":"1820_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"Stefan Karpinski Jeff Bezanson","year":"2017","unstructured":"Bezanson, Stefan Karpinski Jeff, Edelman, Alan, Shah, Viral B.: Julia : A Fresh Approach to Numerical Computing. SIAM Review 59(1), 65\u201398 (2017)","journal-title":"SIAM Review"},{"key":"1820_CR39","doi-asserted-by":"crossref","unstructured":"Cai, D., Wang, X., He, X.: Probabilistic dyadic data analysis with local and global consistency. In Proceedings of the 26th Annual International Conference on Machine Learning (ICML\u201909), pages 105\u2013112, (2009)","DOI":"10.1145\/1553374.1553388"},{"key":"1820_CR40","doi-asserted-by":"crossref","unstructured":"Cai, D., Mei, Q., Han, J., Zhai, C.: Modeling hidden topics on document manifold. In Proceeding of the 17th ACM conference on Information and knowledge management (CIKM\u201908), pages 911\u2013920, (2008)","DOI":"10.1145\/1458082.1458202"},{"key":"1820_CR41","doi-asserted-by":"crossref","unstructured":"Cai, D., He, X., Zhang, W.V., Han, J.: Regularized locality preserving indexing via spectral regression. In Proceedings of the 16th ACM conference on Conference on information and knowledge management (CIKM\u201907), pages 741\u2013750, (2007)","DOI":"10.1145\/1321440.1321544"},{"issue":"12","key":"1820_CR42","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1109\/TKDE.2005.198","volume":"17","author":"Deng Cai","year":"2005","unstructured":"Cai, Deng, He, Xiaofei, Han, Jiawei: Document clustering using locality preserving indexing. IEEE Transactions on Knowledge and Data Engineering 17(12), 1624\u20131637 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1820_CR43","unstructured":"Zhu, Z., Li, X., Liu, K., Li, Q.: Dropping Symmetry for Fast Symmetric Nonnegative Matrix Factorization. NIPS, (2018)"},{"issue":"1\u20132","key":"1820_CR44","first-page":"351","volume":"147","author":"Hou Duo Qi and Xiaoming Yuan","year":"2013","unstructured":"Hou Duo Qi and Xiaoming Yuan: Computing the nearest Euclidean distance matrix with low embedding dimensions. Mathematical Programming 147(1\u20132), 351\u2013389 (2013)","journal-title":"Mathematical Programming"},{"issue":"6","key":"1820_CR45","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MSP.2015.2398954","volume":"32","author":"Ivan Dokmanic","year":"2015","unstructured":"Dokmanic, Ivan, Parhizkar, Reza, Ranieri, Juri, Vetterli, Martin: Euclidean Distance Matrices: Essential theory, algorithms, and applications. IEEE Signal Processing Magazine 32(6), 12\u201330 (2015)","journal-title":"IEEE Signal Processing Magazine"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01820-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-021-01820-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01820-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T13:14:21Z","timestamp":1620479661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-021-01820-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,23]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["1820"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01820-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,23]]},"assertion":[{"value":"11 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The code for reproducing experiments for SymNMF and Euclidean Distance Matrix Completion can be downloaded from the public repository .","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code"}}]}}