{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:37Z","timestamp":1740122677206,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T00:00:00Z","timestamp":1527638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T00:00:00Z","timestamp":1527638400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-08-1-0081","FA9550-11-1-0260"],"award-info":[{"award-number":["FA9550-08-1-0081","FA9550-11-1-0260"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1334327","DMS-1736326"],"award-info":[{"award-number":["CMMI-1334327","DMS-1736326"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10589-018-0010-6","type":"journal-article","created":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T02:47:39Z","timestamp":1527648459000},"page":"353-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A penalty method for rank minimization problems in symmetric matrices"],"prefix":"10.1007","volume":"71","author":[{"given":"Xin","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5087-4679","authenticated-orcid":false,"given":"John E.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.4171\/PM\/1881","volume":"68","author":"AY Alfakih","year":"2011","unstructured":"Alfakih, A.Y., Anjos, M.F., Piccialli, V., Wolkowicz, H.: Euclidean distance matrices, semidefinite programming, and sensor network localization. Port. Math. 68, 53\u2013102 (2011)","journal-title":"Port. Math."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10107-015-0951-9","volume":"159","author":"L Bai","year":"2016","unstructured":"Bai, L., Mitchell, J.E., Pang, J.: On conic QPCCs, conic QCQPs and completely positive programs. Math. Program. 159, 109\u2013136 (2016)","journal-title":"Math. Program."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/140978077","volume":"26","author":"O Burdakov","year":"2016","unstructured":"Burdakov, O., Kanzow, C., Schwartz, A.: Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method. SIAM J. Optim. 26, 397\u2013425 (2016)","journal-title":"SIAM J. Optim."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"S440","DOI":"10.1137\/15M1025153","volume":"38","author":"L Cambier","year":"2016","unstructured":"Cambier, L., Absil, P.-A.: Robust low-rank matrix completion by Riemannian optimization. SIAM J. Sci. Comput. 38, S440\u2013S460 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"10_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-013-0735-z","volume":"147","author":"C Ding","year":"2014","unstructured":"Ding, C., Sun, D., Ye, J.: First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints. Math. Program. 147, 539\u2013579 (2014)","journal-title":"Math. Program."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s11081-008-9072-0","volume":"11","author":"Y Ding","year":"2008","unstructured":"Ding, Y., Krislock, N., Qian, J., Wolkowicz, H.: Sensor network localization, euclidean distance matrix completions, and graph realization. Optim. Eng. 11, 45\u201366 (2008)","journal-title":"Optim. Eng."},{"key":"10_CR10","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of the 2001 American Control Conference, June 2001, IEEE, pp.\u00a04734\u20134739 (2001). https:\/\/faculty.washington.edu\/mfazel\/nucnorm.html"},{"key":"10_CR11","unstructured":"Feng, M., Mitchell, J.E., Pang, J., Shen, X., W\u00e4chter, A.: Complementarity formulations of $$\\ell $$0-norm opti-mization problems. Tech. Report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY (2013). Revised: May 2016"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156, 59\u201399 (2016)","journal-title":"Math. Program."},{"key":"10_CR13","first-page":"155","volume-title":"Nonconvex Optimization and its Applications","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming, in global optimization: from theory to implementation. In: Liberti, L., Maculan, N. (eds.) Nonconvex Optimization and its Applications, pp. 155\u2013210. Springer, Berlin (2006)"},{"key":"10_CR14","volume-title":"Methods of Conjugate Gradients for Solving Linear Systems","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of Conjugate Gradients for Solving Linear Systems. NBS, Bikaner (1952)"},{"key":"10_CR15","unstructured":"Hsieh, C.-J., Olsen, P.: Nuclear norm minimization via active subspace selection. In: International Conference Machine Learning Proceedings, Beijing, China, pp. 575\u2013583 (2014)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10589-006-6441-5","volume":"35","author":"XX Huang","year":"2006","unstructured":"Huang, X.X., Teo, K.L., Yang, X.Q.: Calmness and exact penalization in vector optimization with cone constraints. Comput. Optim. Appl. 35, 47\u201367 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from a few entries. IEEE Trans. Inf. Theory 56, 2980\u20132998 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1080\/1055678031000098773","volume":"18","author":"M Kocvara","year":"2003","unstructured":"Kocvara, M., Stingl, M.: PENNON\u2014a code for convex nonlinear and semidefinite programming. Optim. Methods Softw. 18, 317\u2013333 (2003)","journal-title":"Optim. Methods Softw."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Krislock, N., Wolkowicz, H.: Euclidean distance matrices and applications. In: Anjos, M., Lasserre, J. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operational Research and Management Science. Springer, pp. 879\u2013914 (2012)","DOI":"10.1007\/978-1-4614-0769-0_30"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Laurent, M.: A tour d\u2019horizon on positive semidefinite and Euclidean distance matrix completion problems. In: Topics in Semidefinite and Interior Point Methods, vol. 8 of The Fields Institute for Research in Mathematical Sciences, Communications Series, AMS, Providence, RI (1998)","DOI":"10.1090\/fic\/018\/05"},{"key":"10_CR21","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Advances in Neural Information Processing Systems, Montreal, Canada, pp. 379\u2013387 (2015)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1137\/090771181","volume":"21","author":"Q Li","year":"2011","unstructured":"Li, Q., Qi, H.-D.: A sequential semismooth Newton method for the nearest low-rank correlation matrix problem. SIAM J. Optim. 21, 1641\u20131666 (2011)","journal-title":"SIAM J. Optim."},{"key":"10_CR23","unstructured":"Li, X., Ling, S., Strohmer, T., Wei, K.: Rapid, robust, and reliable blind deconvolution via nonconvex optimization. Tech. Report, Department of Mathematics, University of California Davis, Davis, CA 95616 (2016)"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"2244","DOI":"10.1137\/141000270","volume":"25","author":"Q Lin","year":"2015","unstructured":"Lin, Q., Lu, Z., Xiao, L.: An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization. SIAM J. Optim. 25, 2244\u20132273 (2015)","journal-title":"SIAM J. Optim."},{"key":"10_CR25","unstructured":"Lin, Z., Chen, M., Ma, Y.: The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. Tech. Report, Perception and Decision Lab, University of Illinois, Urbana-Champaign, IL (2010)"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10107-010-0437-8","volume":"133","author":"Y-J Liu","year":"2012","unstructured":"Liu, Y.-J., Sun, D., Toh, K.-C.: An implementable proximal point algorithmic framework for nuclear norm minimization. Math. Program. 133, 399\u2013436 (2012)","journal-title":"Math. Program."},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/090755436","volume":"31","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Vandenberghe, L.: Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix Anal. Appl. 31, 1235\u20131256 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1080\/02331934.2010.527972","volume":"61","author":"S Lu","year":"2012","unstructured":"Lu, S.: Relation between the constant rank and the relaxed constant rank constraint qualifications. Optimization 61, 555\u2013566 (2012)","journal-title":"Optimization"},{"key":"10_CR29","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"1984","unstructured":"Luenberger, D.G.: Linear and Nonlinear Programming, 2nd edn. Addison-Wesley, Menlo Park (1984)","edition":"2"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128, 321\u2013353 (2011)","journal-title":"Math. Program."},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Mohan, K., Fazel, M.: Reweighted nuclear norm minimization with application to system identification. In: Proceedings of the American Control Conference, Baltimore, MD. IEEE, pp.\u00a02953\u20132959 (2010)","DOI":"10.1109\/ACC.2010.5531594"},{"key":"10_CR32","first-page":"3441","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithms for matrix rank minimization. Journal of Machine Learning Research 13, 3441\u20133473 (2012)","journal-title":"Journal of Machine Learning Research"},{"key":"10_CR33","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, New York (2013)"},{"key":"10_CR34","unstructured":"Nesterov, Y.E.: A method for unconstrained convex minimization problem with the rate of convergence $$o(1\/k^2)$$. In: Doklady AN SSSR, vol 269, pp. 543\u2013547 (1983). translated as Soviet Mathematics Doklady"},{"key":"10_CR35","first-page":"2","volume":"78","author":"YE Nesterov","year":"2008","unstructured":"Nesterov, Y.E.: How to advance in structural convex optimization. Optima 78, 2\u20135 (2008)","journal-title":"Optima"},{"key":"10_CR36","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0338-x","volume":"130","author":"TK Pong","year":"2011","unstructured":"Pong, T.K., Tseng, P.: (Robust) edge-based semidefinite programming relaxation of sensor network localization. Math. Program. 130, 321\u2013358 (2011)","journal-title":"Math. Program."},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H Qi","year":"2006","unstructured":"Qi, H., Sun, D.: A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28, 360\u2013385 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10_CR38","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 inequalities via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"10_CR39","unstructured":"Schmidt, M., Roux, N.L., Bach, F.R.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Advances in Neural Information Processing Systems, Granada, Spain, pp. 1458\u20131466 (2011)"},{"key":"10_CR40","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"AM-C So","year":"2007","unstructured":"So, A.M.-C., Ye, Y.: Theory of semidefinite programming for sensor network localization. Math. Program. 109, 367\u2013384 (2007)","journal-title":"Math. Program."},{"key":"10_CR41","unstructured":"Srebro, N., Jaakkola, T.: Weighted low-rank approximations. In: Proceedings of the International Conference on Machine Learning, Atlanta, GA, pp. 720\u2013727 (2003)"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Sun, R., Luo, Z.-Q., Guaranteed matrix completion via nonconvex factorization. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 270\u2013289 (2015)","DOI":"10.1109\/FOCS.2015.25"},{"key":"10_CR43","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.acha.2015.08.003","volume":"40","author":"J Tanner","year":"2016","unstructured":"Tanner, J., Wei, K.: Low rank matrix completion by alternating steepest descent methods. Appl. Comput. Harmonic Anal. 40, 417\u2013429 (2016)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"10_CR44","first-page":"615","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh, K.C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 6, 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"key":"10_CR45","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemannian optimization. SIAM J. Optim. 23, 1214\u20131236 (2013)","journal-title":"SIAM J. Optim."},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Wei, K., Cai, J.-F., Chan, T.F., Leung, S.: Guarantees of Reimannian optimization for low rank matrix completion. Tech. Report, Department of Mathematics, University of California at Davis, CA, USA (2016)","DOI":"10.1137\/15M1050525"},{"key":"10_CR47","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11228-014-0295-2","volume":"23","author":"J Wu","year":"2015","unstructured":"Wu, J., Zhang, L.: On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints. Set Valued Var. Anal. 23, 277\u2013294 (2015)","journal-title":"Set Valued Var. Anal."},{"key":"10_CR48","doi-asserted-by":"publisher","first-page":"24","DOI":"10.15807\/jorsj.58.24","volume":"58","author":"H Yamashita","year":"2015","unstructured":"Yamashita, H., Yabe, H.: A survey of numerical methods for nonlinear semidefinite programming. J. Oper. Res. Soc. Jpn. 58, 24\u201360 (2015)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Ye, J.J., Zhou, J.: First-order optimality conditions for mathematical programs with second-order cone complementarity constraints. Tech. Report, Department of Mathematics and Statistics, University of Victoria, Victoria, BC, Canada (2015)","DOI":"10.1137\/16M1055554"},{"key":"10_CR50","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1007\/s10957-013-0338-0","volume":"162","author":"J Zhai","year":"2014","unstructured":"Zhai, J., Huang, X.X.: Calmness and exact penalization in vector optimization under nonlinear perturbations. J. Optim. Theory Appl. 162, 856\u2013872 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"10_CR51","first-page":"226","volume-title":"A Counterexample for the Validity of Using Nuclear Norm as a Convex Surrogate of Rank, in Machine Learning and Knowledge Discovery in Databases","author":"H Zhang","year":"2013","unstructured":"Zhang, H., Lin, Z., Zhang, C.: A Counterexample for the Validity of Using Nuclear Norm as a Convex Surrogate of Rank, in Machine Learning and Knowledge Discovery in Databases, pp. 226\u2013241. Springer, Berlin (2013)"},{"key":"10_CR52","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s11228-011-0190-z","volume":"19","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., Zhang, L., Wu, J.: Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints. Set Valued Var. Anal. 19, 609\u2013646 (2011)","journal-title":"Set Valued Var. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0010-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0010-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0010-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T16:12:10Z","timestamp":1661357530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0010-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,30]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0010-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,5,30]]},"assertion":[{"value":"4 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}