{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:11:12Z","timestamp":1757779872774,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T00:00:00Z","timestamp":1474588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T00:00:00Z","timestamp":1474588800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-0847077"],"award-info":[{"award-number":["ECCS-0847077"]}],"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-12-1-1002"],"award-info":[{"award-number":["N00014-12-1-1002"]}],"id":[{"id":"10.13039\/100000006","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":[[2017,3]]},"DOI":"10.1007\/s10589-016-9871-8","type":"journal-article","created":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T01:33:04Z","timestamp":1474594384000},"page":"345-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Decomposable norm minimization with proximal-gradient homotopy algorithm"],"prefix":"10.1007","volume":"66","author":[{"given":"Reza","family":"Eghbali","sequence":"first","affiliation":[]},{"given":"Maryam","family":"Fazel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,23]]},"reference":[{"key":"9871_CR1","unstructured":"Agarwal, A., Negahban, S., Wainwright, M.J.: Fast global convergence rates of gradient methods for high-dimensional statistical recovery. In: NIPS, vol. 23, pp. 37\u201345 (2010)"},{"key":"9871_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1214\/07-EJS008","volume":"1","author":"F Bunea","year":"2007","unstructured":"Bunea, F., Tsybakov, A., Wegkamp, M., et al.: Sparsity oracle inequalities for the lasso. Electron. J. Stat. 1, 169\u2013194 (2007)","journal-title":"Electron. J. Stat."},{"issue":"4","key":"9871_CR3","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF 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(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9871_CR4","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"E Candes","year":"2011","unstructured":"Candes, E., Plan, Y.: Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Trans. Inf. Theory 57(4), 2342\u20132359 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9871_CR5","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E., Recht, B.: Simple bounds for recovering low-complexity models. Math. Program. 141(1\u20132), 577\u2013589 (2013)","DOI":"10.1007\/s10107-012-0540-0"},{"issue":"12","key":"9871_CR6","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E Candes","year":"2006","unstructured":"Candes, E., Tao, T.: Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inf. Theory 52(12), 5406\u20135425 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"9871_CR7","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1214\/009053606000001523","volume":"35","author":"E Candes","year":"2007","unstructured":"Candes, E., Tao, T.: he dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann. Stat. 35(6), 2313\u20132351 (2007)","journal-title":"Ann. Stat."},{"issue":"8","key":"9871_CR8","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"6","key":"9871_CR9","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","volume":"12","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Recht, B., Parrilo, P.A., Willsky, A.S.: The convex geometry of linear inverse problems. Found. Comput. Math. 12(6), 805\u2013849 (2012)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"9871_CR10","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"9871_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02759761","volume":"50","author":"Y Gordon","year":"1985","unstructured":"Gordon, Y.: Some inequalities for gaussian processes and applications. Israel J. Math. 50(4), 265\u2013289 (1985)","journal-title":"Israel J. Math."},{"issue":"3","key":"9871_CR12","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory 57(3), 1548\u20131566 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9871_CR13","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: Fixed-point continuation for $$\\ell _1$$-minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"9871_CR14","unstructured":"Hou, K., Zhou, Z., So, A.M., Luo, Z.q.: On the linear convergence of the proximal gradient method for trace norm regularization. In: Advances in Neural Information Processing Systems, pp. 710\u2013718 (2013)"},{"key":"9871_CR15","first-page":"937","volume":"23","author":"P Jain","year":"2010","unstructured":"Jain, P., Meka, R., Dhillon, I.S.: Guaranteed rank minimization via singular value projection. NIPS 23, 937\u2013945 (2010)","journal-title":"NIPS"},{"key":"9871_CR16","unstructured":"Jin, R., Yang, T., Zhu, S.: A new analysis of compressive sensing by stochastic proximal gradient descent. CoRR abs\/1304.4680 (2013)"},{"key":"9871_CR17","volume-title":"Probability in Banach Spaces: Isoperimetry and Processes","author":"M Ledoux","year":"2013","unstructured":"Ledoux, M., Talagrand, M.: Probability in Banach Spaces: Isoperimetry and Processes, vol. 23. Springer, New York (2013)"},{"issue":"3","key":"9871_CR18","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(3), 1235\u20131256 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"9871_CR19","doi-asserted-by":"publisher","first-page":"2164","DOI":"10.1214\/11-AOS896","volume":"39","author":"K Lounici","year":"2011","unstructured":"Lounici, K., Pontil, M., Van De Geer, S., Tsybakov, A.B., et al.: Oracle inequalities and optimal inference under group sparsity. Ann. Stat. 39(4), 2164\u20132204 (2011)","journal-title":"Ann. Stat."},{"key":"9871_CR20","doi-asserted-by":"crossref","unstructured":"Lu, Z., Xiao, L.: On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152(1\u20132), 615\u2013642 (2015)","DOI":"10.1007\/s10107-014-0800-2"},{"issue":"2","key":"9871_CR21","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/0330025","volume":"30","author":"ZQ Luo","year":"1992","unstructured":"Luo, Z.Q., Tseng, P.: On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30(2), 408\u2013425 (1992)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"9871_CR22","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(1), 321\u2013353 (2011)","journal-title":"Math. Program."},{"key":"9871_CR23","first-page":"2287","volume":"11","author":"R Mazumder","year":"2010","unstructured":"Mazumder, R., Hastie, T., Tibshirani, R.: Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res. 11, 2287\u20132322 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"9871_CR24","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1007\/s00039-007-0618-7","volume":"17","author":"S Mendelson","year":"2007","unstructured":"Mendelson, S., Pajor, A., Tomczak-Jaegermann, N.: Reconstruction and subgaussian operators in asymptotic geometric analysis. Geom. Funct. Anal. 17(4), 1248\u20131282 (2007)","journal-title":"Geom. Funct. Anal."},{"key":"9871_CR25","first-page":"2897","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: Fonctions convexes duales et points proximaux dans un espace hilbertien (french). CR Acad. Sci. Paris 255, 2897\u20132899 (1962)","journal-title":"CR Acad. Sci. Paris"},{"issue":"3","key":"9871_CR26","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: Cosamp: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harm. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harm. Anal."},{"issue":"4","key":"9871_CR27","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1214\/12-STS400","volume":"27","author":"SN Negahban","year":"2012","unstructured":"Negahban, S.N., Ravikumar, P., Wainwright, M.J., Yu, B.: A unified framework for high-dimensional analysis of $$m$$-estimators with decomposable regularizers. Stat. Sci. 27(4), 538\u2013557 (2012)","journal-title":"Stat. Sci."},{"issue":"2","key":"9871_CR28","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9871_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"9871_CR30","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1017\/S096249291300007X","volume":"22","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y., Nemirovski, A.: On first-order algorithms for $$\\ell _1$$\/nuclear norm minimization. Acta Numer. 22, 509\u2013575 (2013)","journal-title":"Acta Numer."},{"key":"9871_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y., Nesterov, I.E.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, Amsterdam (2004)"},{"key":"9871_CR32","unstructured":"Nguyen, N., Needell, D., Woolf, T.: Linear convergence of stochastic iterative greedy algorithms with sparse constraints. arXiv preprint \n                    arXiv:1407.0088\n                    \n                   (2014)"},{"issue":"10","key":"9871_CR33","doi-asserted-by":"publisher","first-page":"6976","DOI":"10.1109\/TIT.2011.2165799","volume":"57","author":"G Raskutti","year":"2011","unstructured":"Raskutti, G., Wainwright, M.J., Yu, B.: Minimax rates of estimation for high-dimensional linear regression over-balls. IEEE Trans. Inf. Theory 57(10), 6976\u20136994 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"9871_CR34","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.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"1\u20132","key":"9871_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1\u20132), 1\u201338 (2014)","journal-title":"Math. Program."},{"issue":"5","key":"9871_CR36","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"9871_CR37","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1214\/10-AOS860","volume":"39","author":"A Rohde","year":"2011","unstructured":"Rohde, A., Tsybakov, A.B., et al.: Estimation of high-dimensional low-rank matrices. Ann. Stat. 39(2), 887\u2013930 (2011)","journal-title":"Ann. Stat."},{"key":"9871_CR38","unstructured":"Shalev-Shwartz, S., Gonen, A., Shamir, O.: Large-scale convex minimization with a low-rank constraint. arXiv preprint \n                    arXiv:1106.1622\n                    \n                   (2011)"},{"issue":"6","key":"9871_CR39","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1137\/090759574","volume":"20","author":"S Shalev-Shwartz","year":"2010","unstructured":"Shalev-Shwartz, S., Srebro, N., Zhang, T.: Trading accuracy for sparsity in optimization problems with sparsity constraints. SIAM J. Optim. 20(6), 2807\u20132832 (2010)","journal-title":"SIAM J. Optim."},{"key":"9871_CR40","volume-title":"The Generic Chaining","author":"M Talagrand","year":"2005","unstructured":"Talagrand, M.: The Generic Chaining, vol. 154. Springer, Berlin (2005)"},{"issue":"615\u2013640","key":"9871_CR41","first-page":"15","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), 15 (2010)","journal-title":"Pac. J. Optim."},{"key":"9871_CR42","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1214\/09-EJS506","volume":"3","author":"SA Van De Geer","year":"2009","unstructured":"Van De Geer, S.A., B\u00fchlmann, P., et al.: On the conditions used to prove oracle results for the lasso. Electron. J. Stat. 3, 1360\u20131392 (2009)","journal-title":"Electron. J. Stat."},{"issue":"4","key":"9871_CR43","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32(4), 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"7","key":"9871_CR44","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"9871_CR45","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1137\/120869997","volume":"23","author":"L Xiao","year":"2013","unstructured":"Xiao, L., Zhang, T.: A proximal-gradient homotopy method for the sparse least-squares problem. SIAM J. Optim. 23(2), 1062\u20131091 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9871_CR46","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s40305-013-0015-x","volume":"1","author":"H Zhang","year":"2013","unstructured":"Zhang, H., Jiang, J., Luo, Z.Q.: On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems. Journal of the Operations Research Society of China 1(2), 163\u2013186 (2013)","journal-title":"Journal of the Operations Research Society of China"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9871-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9871-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9871-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:54:18Z","timestamp":1589712858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9871-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,23]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["9871"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9871-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,9,23]]},"assertion":[{"value":"14 January 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}