{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:42Z","timestamp":1740109302090,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T00:00:00Z","timestamp":1549238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T00:00:00Z","timestamp":1549238400000},"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":["IIS-1563950","IIS-1447566"],"award-info":[{"award-number":["IIS-1563950","IIS-1447566"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1447574","IIS-1422557"],"award-info":[{"award-number":["IIS-1447574","IIS-1422557"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1451986","CNS- 1314560"],"award-info":[{"award-number":["CCF-1451986","CNS- 1314560"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0953274","IIS-1029711"],"award-info":[{"award-number":["IIS-0953274","IIS-1029711"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF:CIF:Small:1318347"],"award-info":[{"award-number":["CCF:CIF:Small:1318347"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000104","name":"National Aeronautics and Space Administration","doi-asserted-by":"publisher","award":["NNX12AQ39A"],"award-info":[{"award-number":["NNX12AQ39A"]}],"id":[{"id":"10.13039\/100000104","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000871","name":"Mayo Clinic","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10115-018-1320-9","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T08:03:31Z","timestamp":1549267411000},"page":"1457-1484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scalable algorithms for locally low-rank matrix modeling"],"prefix":"10.1007","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0794-8211","authenticated-orcid":false,"given":"Qilong","family":"Gu","sequence":"first","affiliation":[]},{"given":"Joshua D.","family":"Trzasko","sequence":"additional","affiliation":[]},{"given":"Arindam","family":"Banerjee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,4]]},"reference":[{"key":"1320_CR1","unstructured":"Banerjee A, Chen S, Fazayeli F, Sivakumar V (2014) Estimation with norm regularization. In: Ghahramani Z, Welling M, Cortes C, Lawrence ND, Weinberger KQ (eds) Advances in neural information processing systems 27. Curran Associates, Inc., pp 1556\u20131564"},{"issue":"1","key":"1320_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183\u2013202","journal-title":"SIAM J Imaging Sci"},{"key":"1320_CR3","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming. Athena Scientific, Belmont"},{"issue":"1","key":"1320_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2010","unstructured":"Boyd S, Parikh N, Chu E, Peleato B, Eckstein J (2010) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3(1):1\u2013122","journal-title":"Found Trends Mach Learn"},{"issue":"4","key":"1320_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 EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956\u20131982","journal-title":"SIAM J Optim"},{"issue":"6","key":"1320_CR6","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 EJ, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9(6):717\u2013772","journal-title":"Found Comput Math"},{"issue":"19","key":"1320_CR7","doi-asserted-by":"publisher","first-page":"4643","DOI":"10.1109\/TSP.2013.2270464","volume":"61","author":"EJ Cand\u00e8s","year":"2013","unstructured":"Cand\u00e8s EJ, Sing-long CA, Trzasko JD (2013) Unbiased risk estimates for singular value thresholding and spectral estimators. IEEE Trans Signal Process 61(19):4643\u20134657","journal-title":"IEEE Trans Signal Process"},{"key":"1320_CR8","first-page":"3252","volume-title":"Advances in neural information processing systems 29","author":"S Chen","year":"2016","unstructured":"Chen S, Banerjee A (2016) Structured matrix recovery via the generalized dantzig selector. In: Lee DD, Sugiyama M, Luxburg UV, Guyon I, Garnett R (eds) Advances in neural information processing systems 29. Curran Associates Inc., New York, pp 3252\u20133260"},{"issue":"3","key":"1320_CR9","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10107-002-0306-1","volume":"95","author":"X Chen","year":"2003","unstructured":"Chen X, Tseng P (2003) Non-interior continuation methods for solving semidefinite complementarity problems. Math Program 95(3):431\u2013474","journal-title":"Math Program"},{"issue":"6","key":"1320_CR10","doi-asserted-by":"publisher","first-page":"2413","DOI":"10.1214\/14-AOS1257","volume":"42","author":"D Donoho","year":"2014","unstructured":"Donoho D, Gavish M (2014) Minimax risk of matrix denoising by singular value thresholding. Ann Stat 42(6):2413\u20132440","journal-title":"Ann Stat"},{"key":"1320_CR11","doi-asserted-by":"crossref","unstructured":"Goud S, Hu Y, Jacob M (2010) Real-time cardiac MRI using low-rank and sparsity penalties. In: ISBI, pp.\u00a0988\u2013991","DOI":"10.1109\/ISBI.2010.5490154"},{"key":"1320_CR12","first-page":"1180","volume":"28","author":"S Gunasekar","year":"2015","unstructured":"Gunasekar S, Banerjee A, Ghosh J (2015) Unified view of matrix completion under general structural constraints. Adv Neural Inf Process Syst 28:1180\u20131188","journal-title":"Adv Neural Inf Process Syst"},{"key":"1320_CR13","unstructured":"Haldar JP, Liang ZP (2010) Spatiotemporal imaging with partially separable functions: a matrix recovery approach. In: ISBI, pp.\u00a0716\u2013719"},{"issue":"4","key":"1320_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"AJ Hoffman","year":"1952","unstructured":"Hoffman AJ (1952) On approximate solutions of systems of linear inequalities. J Res Natl Bur Stand 49(4):263\u2013265","journal-title":"J Res Natl Bur Stand"},{"key":"1320_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix analysis","author":"RA Horn","year":"1985","unstructured":"Horn RA, Johnson CR (1985) Matrix analysis, vol 169. Cambridge University Press, Cambridge"},{"key":"1320_CR16","doi-asserted-by":"crossref","unstructured":"Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp.\u00a0426\u2013434","DOI":"10.1145\/1401890.1401944"},{"issue":"15","key":"1320_CR17","first-page":"1","volume":"17","author":"J Lee","year":"2016","unstructured":"Lee J, Kim S, Lebanon G, Singer Y, Bengio S (2016) Llorma: local low-rank matrix approximation. J Mach Learn Res 17(15):1\u201324","journal-title":"J Mach Learn Res"},{"issue":"1","key":"1320_CR18","first-page":"1","volume":"24","author":"Z Lin","year":"2011","unstructured":"Lin Z, Liu R, Su Z (2011) Linearized alternating direction method with adaptive penalty for low-rank representation. Adv Neural Inf Process Syst 24(1):1\u20139","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"1320_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46\u201347","author":"ZQ Luo","year":"1993","unstructured":"Luo ZQ, Tseng P (1993) Error bounds and convergence analysis of feasible descent methods: a general approach. Ann Oper Res 46\u201347(1):157\u2013178","journal-title":"Ann Oper Res"},{"issue":"1","key":"1320_CR20","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 (2011) Fixed point and bregman iterative methods for matrix rank minimization. Math Program 128(1):321\u2013353","journal-title":"Math Program"},{"key":"1320_CR21","first-page":"238","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau JJ (1962) Decomposition orthogonale d\u2019un espace hilbertien selon deux cones mutuellement polaires. Comptes Rendus de l\u2019Acad\u00e9mie des Sci 255:238\u2013240","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sci"},{"issue":"2","key":"1320_CR22","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1214\/10-AOS850","volume":"39","author":"S Negahban","year":"2011","unstructured":"Negahban S, Wainwright MJ (2011) Estimation of (near) low-rank matrices with noise and high-dimensional scaling. Ann Stat 39(2):1069\u20131097","journal-title":"Ann Stat"},{"key":"1320_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization : a basic course, applied optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov Y (2004) Introductory lectures on convex optimization : a basic course, applied optimization. Kluwer Academic Publ, Boston"},{"issue":"3","key":"1320_CR24","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue B, Cand\u00e9s E (2015) Adaptive restart for accelerated gradient schemes. Found Comput Math 15(3):715\u2013732","journal-title":"Found Comput Math"},{"issue":"3","key":"1320_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh N, Boyd S (2014) Proximal algorithms. Found Trends Optim 1(3):127\u2013239","journal-title":"Found Trends Optim"},{"key":"1320_CR26","doi-asserted-by":"crossref","unstructured":"Peng Z, Yan M, Yin W (2013) Parallel and distributed sparse optimization. In: 2013 Asilomar conference on signals, systems and computers, pp.\u00a0659\u2013646","DOI":"10.1109\/ACSSC.2013.6810364"},{"issue":"3","key":"1320_CR27","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht B, Fazel M, Parrilo PA (2010) Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev 52(3):471\u2013501","journal-title":"SIAM Rev"},{"key":"1320_CR28","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton"},{"key":"1320_CR29","first-page":"615","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh KC, Yun S (2010) An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac J Optim 6:615\u2013640","journal-title":"Pac J Optim"},{"key":"1320_CR30","unstructured":"Trzasko JD (2013) Exploiting local low-rank structure in higher-dimensional mri applications. In: Proceedings of SPIE, vol 8858, pp 885821\u2013885828"},{"issue":"6","key":"1320_CR31","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1002\/mrm.24401","volume":"69","author":"JD Trzasko","year":"2013","unstructured":"Trzasko JD, Mostardi PM, Riederer SJ, Manduca A (2013) Estimating t1 from multichannel variable flip angle SPGR sequences. Magn Reson Med 69(6):1787\u20131794","journal-title":"Magn Reson Med"},{"key":"1320_CR32","unstructured":"Trzasko J, Manduca A (2011) Local versus global low-rank promotion in dynamic MRI series reconstruction. In: ISMRM, vol 24, p 4371"},{"issue":"C","key":"1320_CR33","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0024-3795(92)90407-2","volume":"170","author":"GA Watson","year":"1992","unstructured":"Watson GA (1992) Characterization of the subdifferential of some matrix norms. Linear Algebra Appl 170(C):33\u201345","journal-title":"Linear Algebra Appl"},{"key":"1320_CR34","doi-asserted-by":"crossref","unstructured":"Yao Q, Kwok JT (2015) Colorization by patch-based local low-rank matrix completion. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence, AAAI\u201915. AAAI Press, pp. 1959\u20131965","DOI":"10.1609\/aaai.v29i1.9479"},{"key":"1320_CR35","unstructured":"Zhou Z, So AM-C (2015) A unified approach to error bounds for structured convex optimization problems, pp.\u00a01\u201332. arXiv:1512.03518"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1320-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1320-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1320-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T10:06:01Z","timestamp":1662890761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1320-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,4]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1320"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1320-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2019,2,4]]},"assertion":[{"value":"6 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}