{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T16:21:29Z","timestamp":1792513289538,"version":"4.5.0"},"reference-count":39,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>The construction of the gradient of the objective function in gradient-based optimization algorithms for computing an r-term CANDECOMP\/PARAFAC (CP) decomposition of an unstructured dense tensor is a key computational kernel. The best technique for efficiently implementing this operation has a memory consumption that scales linearly with the number of terms r and sublinearly with the number of elements of the tensor. We consider a blockwise computation of the CP gradient, reducing the memory requirements to a constant. This reduction is achieved by a novel technique that we call implicit block unfoldings, which combines the benefits of the block tensor unfoldings by [Ragnarsson and Van Loan, SIAM J. Matrix Anal. Appl., 33 (2012), pp. 149--169] and the implicit unfoldings of [Phan, Tichavsk\u00fd, and Cichocki, IEEE Trans. Signal Process., 61 (2013), pp. 4834--4846]. A heuristic algorithm for automatically choosing the division into subtensors is part of the proposed algorithm. The throughput that can be attained is essentially determined by the performance of a matrix product of two small matrices of constant size. Numerical experiments illustrate that the proposed method can outperform the current state-of-the-art by up to two orders of magnitude for large dense tensors in terms of memory consumption, while the increase of the execution time is no more than 5%. The proposed algorithm attained upward of 90% of the theoretical peak performance of the computer system, using no more than 50MB of memory, irrespective of the size of the tensor and the number of terms r.<\/jats:p>","DOI":"10.1137\/14097968x","type":"journal-article","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T13:42:35Z","timestamp":1434634955000},"page":"C415-C438","source":"Crossref","is-referenced-by-count":24,"title":["Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking"],"prefix":"10.1137","volume":"37","author":[{"given":"Nick","family":"Vannieuwenhoven","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karl","family":"Meerbergen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raf","family":"Vandebril","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,6,18]]},"reference":[{"key":"atypb1","volume-title":"\u016dlhttp:\/\/www.openblas.net (last accessed","author":"Openblas","year":"2014"},{"key":"atypb2","volume-title":"A Massively-Parallel","year":"2014"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1335"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1021\/ac00236a025"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840311"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/s10231-013-0352-8"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/140961389"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/06066518X"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1963"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/120877258"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1145\/77626.79170"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1145\/42288.42291"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/070688316"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.23377"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1145\/1356052.1356053"},{"key":"atypb18","unstructured":"G. Guennebaud, B. Jacob, et al.\n                      Eigen v\\textup3\n                      , http:\/\/eigen.tuxfamily.org (2010)."},{"key":"atypb19","unstructured":"S. Hansen, T. Plantenga, and T. G. Kolda,\n                      Newton-Based Optimization for Kullback-Leiber Nonnegative Tensor Factorizations\n                      , preprint, arXiv:1304.4964, http:\/\/arxiv.org\/abs\/1304.4964, 2014."},{"key":"atypb20","first-page":"1","volume":"16","author":"Harshman R. A.","year":"1970","journal-title":"multi-modal factor analysis, UCLA Working Papers in Phonetics"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.2333\/bhmk.9.11_49"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1002\/sapm19287139"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(98)00077-X"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"atypb26","volume-title":"AMS","author":"Landsberg J. M.","year":"2012"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2009.12.003"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542506100022"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(97)00031-2"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.06.030"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2269903"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1137\/100808034"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1137\/110820609"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.04.014"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1137\/130907215"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1137\/120868323"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2004.07.003"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2004.11.013"},{"key":"atypb39","unstructured":"N. Vannieuwenhoven, N. Vanbaelen, K. Meerbergen, and R. Vandebril,\n                      The Dense Multiple-Vector Tensor-Vector Product: An Initial Study\n                      , Tech. Report TW635, KU Leuven, Leuven, Belgium, 2013."}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/14097968X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:19:40Z","timestamp":1787332780000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/14097968X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/14097968X"],"URL":"https:\/\/doi.org\/10.1137\/14097968x","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}