{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T23:47:23Z","timestamp":1776815243901,"version":"3.51.2"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Leuven Institute for Artificial Intelligence Leuven.ai"},{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["ID-N project no 3E190402"],"award-info":[{"award-number":["ID-N project no 3E190402"]}],"id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["Internal Funds C16\/15\/059"],"award-info":[{"award-number":["Internal Funds C16\/15\/059"]}],"id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["EOS project no 30468160 (SeLMA)"],"award-info":[{"award-number":["EOS project no 30468160 (SeLMA)"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["Junior Postdoctoral Grant (N.Vervliet, 12ZM220N)"],"award-info":[{"award-number":["Junior Postdoctoral Grant (N.Vervliet, 12ZM220N)"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["SB Grant (M. Vandecappelle, 1S66617N)"],"award-info":[{"award-number":["SB Grant (M. Vandecappelle, 1S66617N)"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/jstsp.2020.3045911","type":"journal-article","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T21:24:21Z","timestamp":1608326661000},"page":"491-505","source":"Crossref","is-referenced-by-count":6,"title":["Inexact Generalized Gauss\u2013Newton for Scaling the Canonical Polyadic Decomposition With Non-Least-Squares Cost Functions"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6231-5313","authenticated-orcid":false,"given":"Michiel","family":"Vandecappelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3006-4155","authenticated-orcid":false,"given":"Nico","family":"Vervliet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5562-5014","authenticated-orcid":false,"given":"Lieven De","family":"Lathauwer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2003.1292216"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.1910390116"},{"key":"ref70","article-title":"Tensor-based blind fMRI source separation without the Gaussian noise assumption—a $\\beta$-divergence approach","author":"chatzichristos","year":"0","journal-title":"Proc GlobalSIP"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(97)00031-2"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2004.11.013"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/0720042"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3010719"},{"key":"ref31","first-page":"9550?9560","article-title":"Fast approximate natural gradient descent in a Kronecker factored eigenbasis","author":"george","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","first-page":"2916?2948","article-title":"A stochastic semismooth Newton method for nonsmooth nonconvex optimization","volume":"29","author":"milzarek","year":"2018","journal-title":"SIAM J Optim"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2503260"},{"key":"ref36","first-page":"3?24","article-title":"CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters","volume":"45","author":"carroll","year":"1980","journal-title":"Psychometrika"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/0712047"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/42.712125"},{"key":"ref62","article-title":"Tensorlab 3.0","author":"vervliet","year":"0"},{"key":"ref61","first-page":"140?142","article-title":"Estimation of signal and noise from Rician distributed data","author":"sijbers","year":"0","journal-title":"Proc Int Conf Signal Process Commun"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2982321"},{"key":"ref64","first-page":"9550?9560","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"0","journal-title":"Proc 3rd Int Conf Learn Representations"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref65","article-title":"Stochastic gradients for large-scale tensor decomposition","author":"kolda","year":"0","journal-title":"SIAM J Math Data Sci"},{"key":"ref66","article-title":"Lecture 6.5-RMSProp, Coursera: Neural networks for machine learning","author":"tieleman","year":"2012"},{"key":"ref29","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref67","first-page":"2121?2159","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref68","article-title":"MATLAB Tensor Toolbox version 3.1","author":"bader","year":"0"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1214\/09-STS282"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.1910340618"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.708"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"133?163","DOI":"10.1137\/18M1203626","article-title":"Generalized canonical polyadic tensor decomposition","volume":"62","author":"hong","year":"2020","journal-title":"SIAM Rev"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2015.1009977"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/110859063"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2938663"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/872425"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869679"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.4208\/jcm.1608-m2016-0641"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1121\/1.400532"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.mri.2005.07.008"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492916000076"},{"key":"ref56","volume":"3","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329429"},{"key":"ref53","article-title":"A multilinear singular value decomposition method for a tensor that has missing fibers","author":"s\u00f8rensen","year":"0","journal-title":"Tech Rep"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.03.020"},{"key":"ref10","first-page":"271?283","article-title":"Com2: Fast automatic discovery of temporal (‘comet’) communities","author":"araujo","year":"2014","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1223"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/100808034"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2975353"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2496(02)00028-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2010.2096211"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2008.04-08-771"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/00223890802634175"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-009-0179-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2003.817222"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IMTC.2009.5168426"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/120877258"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(77)90069-6"},{"key":"ref6","first-page":"1970?1984","article-title":"PARAFAC algorithms for large-scale problems","volume":"74","author":"phan","year":"2011","journal-title":"Neurocomputing"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/130916084"},{"key":"ref8","first-page":"81?128","article-title":"Numerical optimization based algorithms for data fusion","author":"vervliet","year":"2018","journal-title":"Data Fusion Theory Methods and Applications"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/120868323"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cem.801"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178522"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/17M1152371"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798414"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1162\/08997660260028683"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"105?113","DOI":"10.1016\/S0169-7439(98)00011-2","article-title":"Improving the speed of multiway algorithms: Part II: Compression","volume":"42","author":"bro","year":"1998","journal-title":"Chemometrics Intell Lab Syst"},{"key":"ref41","first-page":"3917?3921","article-title":"Weighted Krylov–Levenberg-Marquardt method for canonical polyadic tensor decomposition","author":"tichavsk\u00fd","year":"0","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/14097968X"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.896065"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/9393360\/09298833.pdf?arnumber=9298833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:52:44Z","timestamp":1652194364000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9298833\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":73,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2020.3045911","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}