{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:17:16Z","timestamp":1773249436222,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,4,29]],"date-time":"2016-04-29T00:00:00Z","timestamp":1461888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10208-016-9314-z","type":"journal-article","created":{"date-parts":[[2016,4,29]],"date-time":"2016-04-29T18:16:50Z","timestamp":1461953810000},"page":"1037-1083","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Iterative Methods Based on Soft Thresholding of Hierarchical Tensors"],"prefix":"10.1007","volume":"17","author":[{"given":"Markus","family":"Bachmayr","sequence":"first","affiliation":[]},{"given":"Reinhold","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,29]]},"reference":[{"key":"9314_CR1","doi-asserted-by":"crossref","unstructured":"Bachmayr, M., Cohen, A.: Kolmogorov widths and low-rank approximations of parametric elliptic PDEs. Math. Comp. (2016). In press.","DOI":"10.1090\/mcom\/3132"},{"issue":"4","key":"9314_CR2","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1007\/s10208-013-9187-3","volume":"15","author":"M Bachmayr","year":"2015","unstructured":"Bachmayr, M., Dahmen, W.: Adaptive near-optimal rank tensor approximation for high-dimensional operator equations. Found. Comput. Math. 15(4), 839\u2013898 (2015)","journal-title":"Found. Comput. Math."},{"key":"9314_CR3","doi-asserted-by":"crossref","unstructured":"Bachmayr, M., Dahmen, W.: Adaptive low-rank methods: Problems on Sobolev spaces. SIAM J. Numer. Anal. (2016). In press.","DOI":"10.1137\/140978223"},{"issue":"1","key":"9314_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/nla.1818","volume":"20","author":"J Ballani","year":"2013","unstructured":"Ballani, J., Grasedyck, L.: A projection method to solve linear systems in tensor format. Numer. Linear Algebra Appl. 20(1), 27\u201343 (2013)","journal-title":"Numer. Linear Algebra Appl."},{"key":"9314_CR5","doi-asserted-by":"crossref","first-page":"182","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 Sciences 2, 182\u2013202 (2009)","journal-title":"SIAM J. Imaging Sciences"},{"key":"9314_CR6","doi-asserted-by":"crossref","unstructured":"Beylkin, G., Mohlenkamp, M. J.: Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26(6), 2133\u20132159 (electronic) (2005)","DOI":"10.1137\/040604959"},{"key":"9314_CR7","doi-asserted-by":"crossref","unstructured":"Billaud-Friess, M., Nouy, A., Zahm, O.: A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems. ESAIM: M2AN 48(6), 1777\u20131806 (2014).","DOI":"10.1051\/m2an\/2014019"},{"key":"9314_CR8","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1007\/s00041-008-9041-1","volume":"14","author":"K Bredies","year":"2008","unstructured":"Bredies, K., Lorenz, D.\u00a0A.: Linear convergence of iterative soft-thresholding. J Fourier Anal Appl 14, 813\u2013837 (2008)","journal-title":"J Fourier Anal Appl"},{"key":"9314_CR9","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.\u00a0J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J Optimization 20, 1956\u20131982 (2010)","journal-title":"SIAM J Optimization"},{"issue":"12","key":"9314_CR10","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1142\/S0218202511005799","volume":"21","author":"E Canc\u00e8s","year":"2011","unstructured":"Canc\u00e8s, E., Ehrlacher, V., Leli\u00e8vre, T.: Convergence of a greedy algorithm for high-dimensional convex nonlinear problems. Math. Models Methods Appl. Sci. 21(12), 2433\u20132467 (2011)","journal-title":"Math. Models Methods Appl. Sci."},{"issue":"233","key":"9314_CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1090\/S0025-5718-00-01252-7","volume":"70","author":"A Cohen","year":"2001","unstructured":"Cohen, A., Dahmen, W., DeVore, R.: Adaptive wavelet methods for elliptic operator equations: Convergence rates. Mathematics of Computation 70(233), 27\u201375 (2001)","journal-title":"Mathematics of Computation"},{"key":"9314_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0219530511001728","volume":"9","author":"A Cohen","year":"2011","unstructured":"Cohen, A., DeVore, R., Schwab, C.: Analytic regularity and polynomial approximation of parametric and stochastic PDE\u2019s. Analysis and Applications 9, 1\u201337 (2011)","journal-title":"Analysis and Applications"},{"key":"9314_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.laa.2015.04.015","volume":"481","author":"C Silva Da","year":"2015","unstructured":"Da\u00a0Silva, C., Herrmann, F.\u00a0J.: Optimization on the hierarchical Tucker manifold\u2014applications to tensor completion. Linear Algebra Appl. 481, 131\u2013173 (2015)","journal-title":"Linear Algebra Appl."},{"key":"9314_CR14","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1090\/S0025-5718-2011-02507-X","volume":"81","author":"S Dahlke","year":"2012","unstructured":"Dahlke, S., Fornasier, M., Raasch, T.: Multilevel preconditioning and adaptive sparse solution of inverse problems. Math. Comp. 81, 419\u2013446 (2012)","journal-title":"Math. Comp."},{"key":"9314_CR15","doi-asserted-by":"publisher","unstructured":"Dahmen, W., DeVore, R., Grasedyck, L., S\u00fcli, E.: Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations. Found. Comput. Math. (2015). In press. DOI: 10.1007\/s10208-015-9265-9","DOI":"10.1007\/s10208-015-9265-9"},{"issue":"11","key":"9314_CR16","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De\u00a0Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math. 57(11), 1413\u20131457 (2004)","journal-title":"Comm. Pure Appl. Math."},{"key":"9314_CR17","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1017\/S0962492900002816","volume":"7","author":"R DeVore","year":"1998","unstructured":"DeVore, R.: Nonlinear approximation. Acta Numer. 7, 51\u2013150 (1998)","journal-title":"Acta Numer."},{"issue":"5","key":"9314_CR18","doi-asserted-by":"crossref","first-page":"A2248","DOI":"10.1137\/140953289","volume":"36","author":"SV Dolgov","year":"2014","unstructured":"Dolgov, S.\u00a0V., Savostyanov, D.\u00a0V.: Alternating minimal energy methods for linear systems in higher dimensions. SIAM J. Sci. Comput. 36(5), A2248\u2013A2271 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"9314_CR19","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1137\/S0036141096313112","volume":"30","author":"GC Donovan","year":"1999","unstructured":"Donovan, G.\u00a0C., Geronimo, J.\u00a0S., Hardin, D.\u00a0P.: Orthogonal polynomials and the construction of piecewise polynomial smooth wavelets. SIAM J. Math. Anal. 30, 1029\u20131056 (1999)","journal-title":"SIAM J. Math. Anal."},{"issue":"3","key":"9314_CR20","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s00211-011-0437-5","volume":"121","author":"A Falc\u00f3","year":"2012","unstructured":"Falc\u00f3, A., Nouy, A.: Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces. Numer. Math. 121(3), 503\u2013530 (2012)","journal-title":"Numer. Math."},{"issue":"2","key":"9314_CR21","doi-asserted-by":"crossref","first-page":"025010","DOI":"10.1088\/0266-5611\/27\/2\/025010","volume":"27","author":"S Gandy","year":"2011","unstructured":"Gandy, S., Recht, B., Yamada, I.: Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problems 27(2), 025010 (2011)","journal-title":"Inverse Problems"},{"issue":"258","key":"9314_CR22","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1090\/S0025-5718-06-01917-X","volume":"76","author":"T Gantumur","year":"2007","unstructured":"Gantumur, T., Harbrecht, H., Stevenson, R.: An optimal adaptive wavelet method without coarsening of the iterands. Math. Comp. 76(258), 615\u2013629 (2007)","journal-title":"Math. Comp."},{"key":"9314_CR23","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s00607-003-0037-z","volume":"72","author":"L Grasedyck","year":"2004","unstructured":"Grasedyck, L.: Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72, 247\u2013265 (2004)","journal-title":"Computing"},{"issue":"4","key":"9314_CR24","doi-asserted-by":"crossref","first-page":"2029","DOI":"10.1137\/090764189","volume":"31","author":"L Grasedyck","year":"2010","unstructured":"Grasedyck, L.: Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl. 31(4), 2029\u20132054 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"9314_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/gamm.201310004","volume":"36","author":"L Grasedyck","year":"2013","unstructured":"Grasedyck, L., Kressner, D., Tobler, C.: A literature survey of low-rank tensor approximation techniques. GAMM-Mitt. 36(1), 53\u201378 (2013)","journal-title":"GAMM-Mitt."},{"key":"9314_CR26","unstructured":"Hackbusch, W.: Entwicklungen nach Exponentialsummen. Tech. Rep.\u00a04, MPI Leipzig (2005)"},{"key":"9314_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-28027-6","volume-title":"Tensor Spaces and Numerical Tensor Calculus, Springer Series in Computational Mathematics","author":"W Hackbusch","year":"2012","unstructured":"Hackbusch, W.: Tensor Spaces and Numerical Tensor Calculus, Springer Series in Computational Mathematics, vol.\u00a042. Springer-Verlag Berlin Heidelberg (2012)"},{"key":"9314_CR28","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1017\/S0962492914000087","volume":"23","author":"W Hackbusch","year":"2014","unstructured":"Hackbusch, W.: Numerical tensor calculus. Acta Numer. 23, 651\u2013742 (2014)","journal-title":"Acta Numer."},{"key":"9314_CR29","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s00211-008-0143-0","volume":"109","author":"W Hackbusch","year":"2008","unstructured":"Hackbusch, W., Khoromskij, B., Tyrtyshnikov, E.: Approximate iterations for structured matrices. Numerische Mathematik 109, 119\u2013156 (2008)","journal-title":"Numerische Mathematik"},{"issue":"5","key":"9314_CR30","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1007\/s00041-009-9094-9","volume":"15","author":"W Hackbusch","year":"2009","unstructured":"Hackbusch, W., K\u00fchn, S.: A new scheme for the tensor representation. J. Fourier Anal. Appl. 15(5), 706\u2013722 (2009)","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"9314_CR31","doi-asserted-by":"crossref","first-page":"A683","DOI":"10.1137\/100818893","volume":"34","author":"S Holtz","year":"2012","unstructured":"Holtz, S., Rohwedder, T., Schneider, R.: The alternating linear scheme for tensor optimization in the tensor train format. SIAM J. Sci. Comput. 34(2), A683\u2013A713 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"9314_CR32","first-page":"339","volume":"11","author":"B Huang","year":"2015","unstructured":"Huang, B., Mu, C., Goldfarb, D., Wright, J.: Provable models for robust low-rank tensor completion. Pacific Journal of Optimization 11(2), 339\u2013364 (2015)","journal-title":"Pacific Journal of Optimization"},{"issue":"3","key":"9314_CR33","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s00365-009-9068-9","volume":"30","author":"BN Khoromskij","year":"2009","unstructured":"Khoromskij, B.\u00a0N.: Tensor-structured preconditioners and approximate inverse of elliptic operators in $${\\mathbb{R}^{d}}$$ R d . Constr. Approx. 30(3), 599\u2013620 (2009)","journal-title":"Constr. Approx."},{"key":"9314_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/proc\/201448001","volume":"48","author":"BN Khoromskij","year":"2015","unstructured":"Khoromskij, B.\u00a0N.: Tensor numerical methods for multidimensional: PDEs theoretical analysis and initial applications. ESAIM: ProcS 48, 1\u201328 (2015)","journal-title":"ESAIM: ProcS"},{"issue":"1","key":"9314_CR35","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/100785715","volume":"33","author":"BN Khoromskij","year":"2011","unstructured":"Khoromskij, B.\u00a0N., Schwab, C.: Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs. SIAM J. Sci. Comput. 33(1), 364\u2013385 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"9314_CR36","doi-asserted-by":"crossref","unstructured":"Kressner, D., Steinlechner, M., Vandereycken, B.: Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure. preprint (2015)","DOI":"10.1137\/15M1032909"},{"key":"9314_CR37","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1137\/100799010","volume":"32","author":"D Kressner","year":"2011","unstructured":"Kressner, D., Tobler, C.: Low-rank tensor Krylov subspace methods for parametrized linear systems. SIAM J. Matrix Anal. Appl. 32, 1288\u20131316 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9314_CR38","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/j.laa.2015.12.016","volume":"493","author":"D Kressner","year":"2016","unstructured":"Kressner, D., Uschmajew, A.: On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems. Linear Algebra Appl. 493, 556\u2013572 (2016)","journal-title":"Linear Algebra Appl."},{"key":"9314_CR39","unstructured":"K\u00fchn, S.: Hierarchische Tensordarstellung. Ph.D. thesis, Universit\u00e4t Leipzig (2012)"},{"issue":"2","key":"9314_CR40","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/120863290","volume":"6","author":"M-J Lai","year":"2013","unstructured":"Lai, M.-J., Yin, W.: Augmented $$\\ell _1$$ \u2113 1 and nuclear-norm models with a globally linearly convergent algorithm. SIAM Journal on Imaging Sciences 6(2), 1059\u20131091 (2013)","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"1","key":"9314_CR41","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","volume":"35","author":"J Liu","year":"2013","unstructured":"Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 208\u2013220 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1\u20132","key":"9314_CR42","doi-asserted-by":"crossref","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. Mathematical Programming 128(1-2), 321\u2013353 (2011)","journal-title":"Mathematical Programming"},{"issue":"4","key":"9314_CR43","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1070\/RM1964v019n04ABEH001154","volume":"19","author":"AS Markus","year":"1964","unstructured":"Markus, A.\u00a0S.: The eigen- and singular values of the sum and product of linear operators. Russian Mathematical Surveys 19(4), 91\u2013120 (1964)","journal-title":"Russian Mathematical Surveys"},{"key":"9314_CR44","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1093\/qmath\/11.1.50","volume":"11","author":"L Mirsky","year":"1960","unstructured":"Mirsky, L.: Symmetric gauge functions and unitarily invariant norms. Quarterly Journal of Mathematics 11, 50\u201359 (1960)","journal-title":"Quarterly Journal of Mathematics"},{"key":"9314_CR45","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J Moreau","year":"1965","unstructured":"Moreau, J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France 93, 273\u2013299 (1965)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France"},{"issue":"5","key":"9314_CR46","doi-asserted-by":"crossref","first-page":"3744","DOI":"10.1137\/090748330","volume":"31","author":"I Oseledets","year":"2009","unstructured":"Oseledets, I., Tyrtyshnikov, E.: Breaking the curse of dimensionality, or how to use SVD in many dimensions. SIAM J. Sci. Comput. 31(5), 3744\u20133759 (2009)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"9314_CR47","doi-asserted-by":"crossref","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.\u00a0V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"9314_CR48","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.\u00a0A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM review 52(3), 471\u2013501 (2010)","journal-title":"SIAM review"},{"issue":"2","key":"9314_CR49","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.jco.2013.10.001","volume":"30","author":"R Schneider","year":"2014","unstructured":"Schneider, R., Uschmajew, A.: Approximation rates for the hierarchical tensor format in periodic Sobolev spaces. J. Complexity 30(2), 56\u201371 (2014)","journal-title":"J. Complexity"},{"key":"9314_CR50","doi-asserted-by":"crossref","first-page":"147902","DOI":"10.1103\/PhysRevLett.91.147902","volume":"91","author":"G Vidal","year":"2003","unstructured":"Vidal, G.: Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91, 147902 (2003)","journal-title":"Phys. Rev. Lett."},{"key":"9314_CR51","doi-asserted-by":"crossref","first-page":"2863","DOI":"10.1103\/PhysRevLett.69.2863","volume":"69","author":"SR White","year":"1992","unstructured":"White, S.\u00a0R.: Density matrix formulation for quantum renormalization groups. Phys. Rev. Lett. 69, 2863\u20132866 (1992)","journal-title":"Phys. Rev. Lett."},{"key":"9314_CR52","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.\u00a0J., Nowak, R.\u00a0D., Figueiredo, M. A.\u00a0T.: Sparse reconstruction by separable approximation. IEEE Trans Sig. Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans Sig. Process."},{"key":"9314_CR53","doi-asserted-by":"publisher","unstructured":"Yuan, M., Zhang, C.-H.: On tensor completion via nuclear norm minimization. Found. Comput. Math. (2015). In press. DOI: 10.1007\/s10208-015-9269-5","DOI":"10.1007\/s10208-015-9269-5"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-016-9314-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9314-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9314-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-016-9314-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T04:47:25Z","timestamp":1567831645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-016-9314-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,29]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["9314"],"URL":"https:\/\/doi.org\/10.1007\/s10208-016-9314-z","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,29]]}}}