{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:33:57Z","timestamp":1730230437663,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/icassp40776.2020.9053849","type":"proceedings-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T20:21:13Z","timestamp":1586463673000},"page":"3147-3151","source":"Crossref","is-referenced-by-count":2,"title":["Extrapolated Alternating Algorithms for Approximate Canonical Polyadic Decomposition"],"prefix":"10.1109","author":[{"given":"Andersen Man","family":"Shun Ang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy E.","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le Thi","family":"Khanh Hien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Gillis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Foundations of the PARAFAC procedure: Models and conditions for an ”explanatory\" multimodal factor analysis","volume":"16","author":"harshman","year":"1970","journal-title":"UCLA Working Papers in Phonetics"},{"key":"ref11","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate o (1\/k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/16M1064064"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-014-0074-y"},{"key":"ref15","first-page":"1","article-title":"A differential equation for modeling nesterov’s accelerated gradient method: Theory and insights","volume":"17","author":"boyd w su","year":"2016","journal-title":"Journal of Machine Learning Research"},{"article-title":"A dynamical systems perspective on nesterov acceleration","year":"2019","author":"muehlebach","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"article-title":"Nesterov acceleration of alternating least squares for canonical tensor decomposition","year":"2018","author":"mitchell","key":"ref18"},{"article-title":"Inertial block mirror descent method for non-convex non-smooth optimization","year":"2019","author":"hien","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/110843587"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00256"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1236"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/06066518X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1335"},{"key":"ref20","article-title":"Multi-way Analysis in the Food Industry: Models, Algorithms, and Applications","author":"bro","year":"1998","journal-title":"Ph D thesis"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2014.7094512"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1162\/neco_a_01157"},{"key":"ref24","article-title":"Accelerating approximate nonnegative canonical polyadic decomposition using extrapolation","author":"ang","year":"2019","journal-title":"Colloque GRETSI"},{"key":"ref23","first-page":"59","article-title":"Large scale tensor decompositions: Algorithmic developments and applications","volume":"36","author":"papalexakis","year":"2013","journal-title":"IEEE Data Eng Bull"}],"event":{"name":"ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2020,5,4]]},"location":"Barcelona, Spain","end":{"date-parts":[[2020,5,8]]}},"container-title":["ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9040208\/9052899\/09053849.pdf?arnumber=9053849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:19:11Z","timestamp":1656375551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9053849\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icassp40776.2020.9053849","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}