{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:27:27Z","timestamp":1777537647003,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T00:00:00Z","timestamp":1529280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11571120"],"award-info":[{"award-number":["11571120"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11701186"],"award-info":[{"award-number":["11701186"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Natural Science Foundation of Guangdong Province","award":["2015A030313214"],"award-info":[{"award-number":["2015A030313214"]}]},{"name":"the Natural Science Foundation of Guangdong Province","award":["2017A030310418"],"award-info":[{"award-number":["2017A030310418"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10898-018-0675-5","type":"journal-article","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T10:25:42Z","timestamp":1529317542000},"page":"679-704","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Equivalent Lipschitz surrogates for zero-norm and rank optimization problems"],"prefix":"10.1007","volume":"72","author":[{"given":"Yulan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shujun","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaohua","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,18]]},"reference":[{"key":"675_CR1","first-page":"1179","volume":"9","author":"FR Bach","year":"2008","unstructured":"Bach, F.R.: Consistency of the group lasso and multiple kernel learning. J. Mach. Learn. Res. 9, 1179\u20131225 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"675_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"675_CR3","doi-asserted-by":"publisher","first-page":"A1451","DOI":"10.1137\/110855867","volume":"36","author":"JS Bi","year":"2014","unstructured":"Bi, J.S., Liu, X.L., Pan, S.H.: Exact penalty decomposition method for zero-norm minimization based on MPEC formulations. SIAM J. Sci. Comput. 36, A1451\u2013A1477 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"675_CR4","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.1137\/15M1037160","volume":"55","author":"JS Bi","year":"2017","unstructured":"Bi, J.S., Pan, S.H.: Multi-stage convex relaxation approach to rank regularized minimization problems based on equivalent MPGCCs. SIAM J. Control Optim. 55, 2493\u20132518 (2017)","journal-title":"SIAM J. Control Optim."},{"key":"675_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)"},{"key":"675_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20192-9","volume-title":"Statistics for High-Dimensional Data: Methods, Theory and Applications","author":"P B\u00fchlmann","year":"2011","unstructured":"B\u00fchlmann, P., Sara, V.D.G.: Statistics for High-Dimensional Data: Methods, Theory and Applications. Springer, Berlin (2011)"},{"key":"675_CR7","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$l_1$$ l 1 minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"675_CR8","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"675_CR9","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Plain, Y.: Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Trans. Inf. Theory 57, 2342\u20132359 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"675_CR10","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1137\/15M1028054","volume":"26","author":"XJ Chen","year":"2016","unstructured":"Chen, X.J., Lu, Z.S., Pong, T.K.: Penalty methods for a class of non-Lipschitz optimization problems. SIAM J. Optim. 26, 1465\u20131492 (2016)","journal-title":"SIAM J. Optim."},{"key":"675_CR11","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"key":"675_CR12","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/0149053","volume":"49","author":"DL Donoho","year":"1989","unstructured":"Donoho, D.L., Stark, B.F.: Uncertainty principles and signal recovery. SIAM J. Appl. Math. 49, 906\u2013931 (1989)","journal-title":"SIAM J. Appl. Math."},{"key":"675_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1137\/0152031","volume":"52","author":"DL Donoho","year":"1992","unstructured":"Donoho, D.L., Logan, B.F.: Signal recovery and the large sieve. SIAM J. Appl. Math. 52, 577\u2013591 (1992)","journal-title":"SIAM J. Appl. Math."},{"key":"675_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-87821-8","volume-title":"Implicit Functions and Solution Mappings\u2014A View from Variational Analysis","author":"AL Dontchev","year":"2009","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings\u2014A View from Variational Analysis. Springer, Berlin (2009)"},{"key":"675_CR15","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"JQ Fan","year":"2001","unstructured":"Fan, J.Q., Li, R.Z.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"675_CR16","unstructured":"Fazel, M.: Matrix rank minimization with applications. Ph.D. thesis, Stanford University (2002)"},{"key":"675_CR17","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.: Log-det heuirstic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. In: American Control Conference, 2003. Proceedings of the 2003, vol. 3, pp. 2156\u20132162 (2003)","DOI":"10.1109\/ACC.2003.1243393"},{"key":"675_CR18","unstructured":"Feng, M.B., Mitchell, J.E., Pang, J.S., Shen, X., W\u00e4chter, A.: Complementarity formulations of $$\\ell_0$$ \u2113 0 -norm optimization problems. Industrial Engineering and Management Sciences. Technical Report. Northwestern University, USA (2013)"},{"key":"675_CR19","unstructured":"Golbabaee, M., Vandergheynst, P.: Hyperspectral image compressed sensing via low-rank and joint sparse matrix recovery. In: Proceedings of IEEE International Conference on on Acoustics, Speech and Signal Processing, Kyota, (2011), pp. 2741-2744"},{"key":"675_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)"},{"key":"675_CR21","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":"675_CR22","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"HA Thi Le","year":"2012","unstructured":"Le Thi, H.A., Pham, D.T., Huynh, V.N.: Exact penalty and error bounds in DC programming. J. Glob. Optim. 52, 509\u2013535 (2012)","journal-title":"J. Glob. Optim."},{"key":"675_CR23","first-page":"173","volume":"2","author":"AS Lewis","year":"1995","unstructured":"Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2, 173\u2013183 (1995)","journal-title":"J. Convex Anal."},{"key":"675_CR24","unstructured":"Li, P., Rangapuram, S.S., Slawski, M.: Methods for sparse and low-rank recovery under simplex constraints. arXiv:1605.00507 (2016)"},{"key":"675_CR25","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y.Y., Yin, W.T.: Improved iteratively reweighted least squares for unconstrained smoothed $$\\ell_q$$ \u2113 q minimization. SIAM J. Numer. Anal. 51, 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"675_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"ZQ Luo","year":"1996","unstructured":"Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"key":"675_CR27","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10107-015-0961-7","volume":"159","author":"WM Miao","year":"2016","unstructured":"Miao, W.M., Pan, S.H., Sun, D.F.: A rank-corrected procedure for matrix completion with fixed basis coefficients. Math. Program. 159, 289\u2013338 (2016)","journal-title":"Math. Program."},{"key":"675_CR28","first-page":"3441","volume":"13","author":"K Mohan","year":"2012","unstructured":"Mohan, K., Fazel, M.: Iterative reweighted algorithm for matrix rank minimization. J. Mach. Learn. Res. 13, 3441\u20133473 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"675_CR29","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1214\/10-AOS850","volume":"39","author":"S Negahban","year":"2011","unstructured":"Negahban, S., Wainwright, M.J.: Estimation of (near) low-rank matrices with noise and high-dimensional scaling. Ann. Stat. 39, 1069\u20131097 (2011)","journal-title":"Ann. Stat."},{"key":"675_CR30","first-page":"1665","volume":"13","author":"S Negahban","year":"2012","unstructured":"Negahban, S., Wainwright, M.J.: Restricted strong convexity and weighted matrix completion: optimal bounds with noise. J. Mach. Learn. Res. 13, 1665\u20131697 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"675_CR31","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$O(1\/k^2)$$ O ( 1 \/ k 2 ) . Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"675_CR32","doi-asserted-by":"publisher","first-page":"2886","DOI":"10.1109\/TIT.2015.2401574","volume":"61","author":"S Oymak","year":"2015","unstructured":"Oymak, S., Jalali, A., Fazel, M., Eldar, Y.C., Hassibi, B.: Simultaneously structured models with application to sparse and low-rank matrices. IEEE Trans. Inf. Theory 61, 2886\u20132908 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"675_CR33","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/TPAMI.2011.282","volume":"34","author":"YG Peng","year":"2012","unstructured":"Peng, Y.G., Ganesh, A., Wright, J., Xu, W.L., Ma, Y.: RASL: robust alignment via sparse and low-rank decomposition for linearly correlated images. IEEE Trans. Pattern Anal. Mach. Intell. 34, 2233\u20132246 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"675_CR34","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1080\/14697680400016182","volume":"4","author":"R Pietersz","year":"2004","unstructured":"Pietersz, R., Groenen, P.J.F.: Rank reduction of correlation matrices by majorization. Quant. Finance 4, 649\u2013662 (2004)","journal-title":"Quant. Finance"},{"key":"675_CR35","unstructured":"Richard, E., Savalle, P., Vayatis, N.: Estimation simultaneously sparse and low rank matrices. In: Proceedings of the 29th International Conference on Machine Learning (ICML), pp. 1351\u20131358 (2012)"},{"key":"675_CR36","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, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"675_CR37","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"675_CR38","first-page":"2056","volume":"23","author":"R Salakhutdinov","year":"2010","unstructured":"Salakhutdinov, R., Srebro, N.: Collaborative filtering in a non-uniform world: learning with the weighted trace norm. Adv. Neural Inf. Process. Syst. (NIPS) 23, 2056\u20132064 (2010)","journal-title":"Adv. Neural Inf. Process. Syst. (NIPS)"},{"key":"675_CR39","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. R. Stat. Soc. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. B"},{"key":"675_CR40","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"51","author":"J Tropp","year":"2006","unstructured":"Tropp, J.: Just relax: convex programming methods for identifying sparse signals. IEEE Trans. Inf. Theory 51, 1030\u20131051 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"675_CR41","first-page":"615","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh, K.C., Yun, S.W.: 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":"675_CR42","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1002\/mrm.22883","volume":"66","author":"M Usman","year":"2011","unstructured":"Usman, M., Prieto, C., Schaeffter, T., Batchelor, P.G.: $$k-t$$ k - t Group sparse: a method for accelerating dynamic MRI. Magn. Reson. Med. 66, 1163\u20131176 (2011)","journal-title":"Magn. Reson. Med."},{"key":"675_CR43","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/02331939508844060","volume":"33","author":"JJ Ye","year":"1995","unstructured":"Ye, J.J., Zhu, D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9\u201327 (1995)","journal-title":"Optimization"},{"key":"675_CR44","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1137\/S1052623493257344","volume":"7","author":"JJ Ye","year":"1997","unstructured":"Ye, J.J., Zhu, D.L., Zhu, Q.J.: Exact penalization and necessary optimality conditions for generalized bilevel programming problems. SIAM J. Optim. 7, 481\u2013507 (1997)","journal-title":"SIAM J. Optim."},{"key":"675_CR45","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1287\/moor.22.4.977","volume":"4","author":"JJ Ye","year":"1997","unstructured":"Ye, J.J., Ye, X.Y.: Necessary optimality conditions for optimization problems with variational inequality constraints. Math. Oper. Res. 4, 977\u2013997 (1997)","journal-title":"Math. Oper. Res."},{"key":"675_CR46","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. B 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. B"},{"key":"675_CR47","doi-asserted-by":"crossref","unstructured":"Zhou, Z.H., Li, X.D., Wright, J., Cand\u00e8s, E.J., Ma, Y.: Stable principal component pursuit. In: IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1518\u20131522 (2010)","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"675_CR48","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"675_CR49","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1198\/016214506000000735","volume":"101","author":"H Zou","year":"2006","unstructured":"Zou, H.: The adaptive Lasso and its Oracle properties. J. Am. Stat. Assoc. 101, 1418\u20131429 (2006)","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0675-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0675-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0675-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:51:29Z","timestamp":1751691089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0675-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,18]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["675"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0675-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,18]]},"assertion":[{"value":"25 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}