{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T22:23:57Z","timestamp":1780525437777,"version":"3.54.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11431002"],"award-info":[{"award-number":["11431002"]}],"id":[{"id":"10.13039\/501100001809","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":[[2020,3]]},"DOI":"10.1007\/s10957-019-01606-8","type":"journal-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T07:02:35Z","timestamp":1575874955000},"page":"895-930","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Matrix Optimization Over Low-Rank Spectral Sets: Stationary Points and Local and Global Minimizers"],"prefix":"10.1007","volume":"184","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7034-910X","authenticated-orcid":false,"given":"Xinrong","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shenglong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"issue":"3","key":"1606_CR1","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"1606_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2227-2","volume-title":"Low Rank Approximation","author":"I Markovsky","year":"2012","unstructured":"Markovsky, I.: Low Rank Approximation. Springer, London (2012)"},{"key":"1606_CR3","unstructured":"Ding, C.: An introduction to a class of matrix optimization problems. Ph.D. thesis, National University of Singapore (2012)"},{"issue":"1","key":"1606_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000055","volume":"9","author":"M Udell","year":"2016","unstructured":"Udell, M., Horn, C., Zadeh, R.B., Boyd, S.P.: Generalized low rank models. Mach. Learn. 9(1), 1\u2013118 (2016)","journal-title":"Mach. Learn."},{"issue":"4","key":"1606_CR5","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/JSTSP.2016.2539100","volume":"10","author":"MA Davenport","year":"2016","unstructured":"Davenport, M.A., Romberg, J.: An overview of low-rank matrix recovery from incomplete observations. IEEE J. Sel. Top. Signal Process. 10(4), 608\u2013622 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"1606_CR6","unstructured":"Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Stanford University (2002)"},{"issue":"5","key":"1606_CR7","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"},{"issue":"11","key":"1606_CR8","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1109\/TSP.2012.2212015","volume":"60","author":"G Marjanovic","year":"2012","unstructured":"Marjanovic, G., Solo, V.: On $$l_q$$ optimization and matrix completion. IEEE Trans. Signal Process. 60(11), 5714\u20135724 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"Nov","key":"1606_CR9","first-page":"3441","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithms for matrix rank minimization. J. Mach. Learn. Res. 13(Nov), 3441\u20133473 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"1606_CR10","doi-asserted-by":"crossref","unstructured":"Nie, F., Wang, H., Cai, X., Huang, H., Ding, C.: Robust matrix completion via joint schatten p-norm and $$l_{p}$$-norm minimization. In: IEEE International Conference on Data Mining, pp. 566\u2013574 (2012)","DOI":"10.1109\/ICDM.2012.160"},{"issue":"7","key":"1606_CR11","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1007\/s11590-013-0701-y","volume":"8","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Xiu, N., Peng, D.: Global solutions of non-lipschitz $$s_{2}$$-$$s_{p}$$ minimization over the positive semidefinite cone. Optim. Lett. 8(7), 2053\u20132064 (2014)","journal-title":"Optim. Lett."},{"issue":"1","key":"1606_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.laa.2012.02.021","volume":"437","author":"YB Zhao","year":"2012","unstructured":"Zhao, Y.B.: An approximation theory of matrix rank minimization and its application to quadratic equations. Linear Algebra Appl. 437(1), 77\u201393 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"9","key":"1606_CR13","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"H Yao","year":"2013","unstructured":"Yao, H., Debing, Z., Jieping, Y., Xuelong, L., Xiaofei, H.: Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2117\u20132130 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"1606_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.C.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003)","journal-title":"Math. Program."},{"issue":"5","key":"1606_CR15","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1137\/080731359","volume":"20","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Bach, F., Absil, P.A., Sepulchre, R.: Low-rank optimization on the cone of positive semidefinite matrices. SIAM J. Optim. 20(5), 2327\u20132351 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1606_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"key":"1606_CR17","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, pp. 665\u2013674. ACM (2013)","DOI":"10.1145\/2488608.2488693"},{"key":"1606_CR18","doi-asserted-by":"crossref","unstructured":"Hardt, M.: Understanding alternating minimization for matrix completion. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 651\u2013660. IEEE (2014)","DOI":"10.1109\/FOCS.2014.75"},{"issue":"11","key":"1606_CR19","doi-asserted-by":"publisher","first-page":"6535","DOI":"10.1109\/TIT.2016.2598574","volume":"62","author":"R Sun","year":"2016","unstructured":"Sun, R., Luo, Z.: Guaranteed matrix completion via non-convex factorization. IEEE Trans. Inf. Theory 62(11), 6535\u20136579 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1606_CR20","unstructured":"Gao, Y.: Structured low rank matrix optimization problems: A penalty approach. Ph.D. thesis, National University of Singapore (2010)"},{"issue":"9","key":"1606_CR21","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1016\/j.automatica.2006.03.017","volume":"42","author":"SJ Kim","year":"2006","unstructured":"Kim, S.J., Moon, Y.H.: Structurally constrained $${H}_{2}$$ and $${H}_{\\infty }$$ control: a rank-constrained LMI approach. Automatica 42(9), 1583\u20131588 (2006)","journal-title":"Automatica"},{"issue":"3","key":"1606_CR22","doi-asserted-by":"publisher","first-page":"10373","DOI":"10.3182\/20140824-6-ZA-1003.02690","volume":"47","author":"RA Delgado","year":"2014","unstructured":"Delgado, R.A., Ag\u00fcero, J.C., Goodwin, G.C.: A rank-constrained optimization approach: application to factor analysis. IFAC Proc. Vol. 47(3), 10373\u201310378 (2014)","journal-title":"IFAC Proc. Vol."},{"issue":"3","key":"1606_CR23","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.orl.2016.03.002","volume":"44","author":"S Bi","year":"2016","unstructured":"Bi, S., Pan, S.: Error bounds for rank constrained optimization problems and applications. Oper. Res. Lett. 44(3), 336\u2013341 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"16","key":"1606_CR24","doi-asserted-by":"publisher","first-page":"4331","DOI":"10.1109\/TSP.2018.2849734","volume":"66","author":"S Zhou","year":"2018","unstructured":"Zhou, S., Xiu, N., Qi, H.: A fast matrix majorization-projection method for penalized stress minimization with box constraints. IEEE Trans. Signal Process. 66(16), 4331\u20134346 (2018)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1606_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10851-012-0406-3","volume":"47","author":"DR Luke","year":"2013","unstructured":"Luke, D.R.: Prox-regularity of rank constraint sets and implications for algorithms. J. Math. Imaging Vis. 47(3), 231\u2013238 (2013)","journal-title":"J. Math. Imaging Vis."},{"key":"1606_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"4","key":"1606_CR27","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1016\/j.laa.2011.12.004","volume":"438","author":"TP Cason","year":"2013","unstructured":"Cason, T.P., Absil, P.A., Dooren, P.V.: Iterative methods for low rank approximation of graph similarity matrices. Linear Algebra Appl. 438(4), 1863\u20131882 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1606_CR28","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/140957822","volume":"25","author":"R Schneider","year":"2015","unstructured":"Schneider, R., Uschmajew, A.: Convergence results for projected line-search methods on varieties of low-rank matrices via \u0142ojasiewicz inequality. SIAM J. Optim. 25(1), 622\u2013646 (2015)","journal-title":"SIAM J. Optim."},{"key":"1606_CR29","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.neucom.2016.02.030","volume":"192","author":"G Zhou","year":"2016","unstructured":"Zhou, G., Huang, W., Gallivan, K.A., Van Dooren, P., Absil, P.A.: A Riemannian rank-adaptive method for low-rank optimization. Neurocomputing 192, 72\u201380 (2016)","journal-title":"Neurocomputing"},{"issue":"2","key":"1606_CR30","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s40305-019-00245-0","volume":"7","author":"X Li","year":"2019","unstructured":"Li, X., Song, W., Xiu, N.: Optimality conditions for rank-constrained matrix optimization. J. Oper. Res. Soc. China 7(2), 285\u2013301 (2019)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"2","key":"1606_CR31","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2), 215\u2013245 (1995)","journal-title":"Combinatorica"},{"key":"1606_CR32","doi-asserted-by":"crossref","unstructured":"Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: International Symposium on Information Processing in Sensor Networks (2004)","DOI":"10.1145\/984622.984630"},{"key":"1606_CR33","doi-asserted-by":"crossref","unstructured":"Ji, S., Sze, K.F., Zhou, Z., So, M.C., Ye, Y.: Beyond convex relaxation: a polynomial-time non-convex optimization approach to network localization. In: IEEE Infocom (2013)","DOI":"10.1109\/INFCOM.2013.6567056"},{"issue":"5","key":"1606_CR34","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1137\/090776718","volume":"31","author":"R Borsdorf","year":"2010","unstructured":"Borsdorf, R., Higham, N.J., Raydan, M.: Computing a nearest correlation matrix with factor structure. SIAM J. Matrix Anal. Appl. 31(5), 2603\u20132622 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1606_CR35","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1093\/imanum\/22.3.329","volume":"22","author":"NJ Higham","year":"2018","unstructured":"Higham, N.J.: Computing the nearest correlation matrix a problem from finance. IMA J. Numer. Anal. 22(3), 329\u2013343 (2018)","journal-title":"IMA J. Numer. Anal."},{"issue":"2\u20133","key":"1606_CR36","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10107-006-0026-z","volume":"109","author":"I Dukanovic","year":"2007","unstructured":"Dukanovic, I., Rendl, F.: Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program. 109(2\u20133), 345\u2013365 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"1606_CR37","doi-asserted-by":"publisher","first-page":"15018","DOI":"10.1038\/npjqi.2015.18","volume":"1","author":"A Kalev","year":"2015","unstructured":"Kalev, A., Kosut, R.L., Deutsch, I.H.: Quantum tomography protocols with positivity are compressed sensing protocols. Nat. Partn. J. Quantum Inf. 1(1), 15018 (2015)","journal-title":"Nat. Partn. J. Quantum Inf."},{"issue":"4","key":"1606_CR38","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/S0895479895283173","volume":"17","author":"AS Lewis","year":"1996","unstructured":"Lewis, A.S.: Group invariance and convex matrix analysis. SIAM J. Matrix Anal. Appl. 17(4), 927\u2013949 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"1606_CR39","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/j.jmaa.2016.10.040","volume":"447","author":"MK Tam","year":"2017","unstructured":"Tam, M.K.: Regularity properties of non-negative sparsity sets. J. Math. Anal. Appl. 447(2), 758\u2013777 (2017)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"1606_CR40","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1080\/10556788.2014.936438","volume":"30","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Zhang, Y., Li, X.: Penalty decomposition methods for rank minimization. Optim. Methods Softw. 30(3), 531\u2013558 (2015)","journal-title":"Optim. Methods Softw."},{"key":"1606_CR41","unstructured":"Kyrillidis, A.: Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences. Ph.D. thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (2014)"},{"key":"1606_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation I: Basic Theory","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I: Basic Theory, vol. 330. Springer, Berlin (2006)"},{"key":"1606_CR43","volume-title":"Fundamentals of Convex Analysis","author":"JB Hiriart-Urruty","year":"2012","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Berlin (2012)"},{"issue":"1","key":"1606_CR44","first-page":"119","volume":"25","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Kempton, C.: Variational analysis of spectral functions simplified. J. Convex Anal. 25(1), 119\u2013134 (2018)","journal-title":"J. Convex Anal."},{"key":"1606_CR45","unstructured":"Lu, Z.: Optimization over sparse symmetric sets via a nonmonotone projected gradient method (2015). arXiv preprint arXiv:1509.08581"},{"issue":"5","key":"1606_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11425-016-9010-x","volume":"60","author":"L Pan","year":"2017","unstructured":"Pan, L., Xiu, N., Fan, J.: Optimality conditions for sparse nonlinear programming. Sci. China Math. 60(5), 1\u201318 (2017)","journal-title":"Sci. China Math."},{"issue":"3","key":"1606_CR47","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J. Optim. 23(3), 1480\u20131509 (2013)","journal-title":"SIAM J. Optim."},{"key":"1606_CR48","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, New York (2013)","edition":"2"},{"issue":"2","key":"1606_CR49","first-page":"325","volume":"13","author":"L Pan","year":"2017","unstructured":"Pan, L., Zhou, S., Xiu, N., Qi, H.D.: A convergent iterative hard thresholding for nonnegative sparsity optimization. Pac. J. Optim. 13(2), 325\u2013353 (2017)","journal-title":"Pac. J. Optim."},{"key":"1606_CR50","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01606-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01606-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01606-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T00:40:06Z","timestamp":1607388006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01606-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1606"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01606-8","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"assertion":[{"value":"24 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}