{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T12:25:54Z","timestamp":1770467154301,"version":"3.49.0"},"reference-count":44,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2015,9,3]]},"DOI":"10.1080\/10556788.2015.1009977","type":"journal-article","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T04:30:33Z","timestamp":1430368233000},"page":"1002-1029","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":41,"title":["Newton-based optimization for Kullback\u2013Leibler nonnegative tensor factorizations"],"prefix":"10.1080","volume":"30","author":[{"given":"Samantha","family":"Hansen","sequence":"first","affiliation":[{"name":",","place":["USA"]}]},{"given":"Todd","family":"Plantenga","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}]},{"given":"Tamara G.","family":"Kolda","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Livermore, CA, USA"}]}],"member":"301","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"key":"e_1_3_5_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1335"},{"key":"e_1_3_5_3_1","doi-asserted-by":"crossref","unstructured":"G. Andrew and J. Gao Scalable Training of -Regularized Log-Linear Models Proceedings of the 24th International Conference on Machine Learning Corvallis OR ACM 2007 pp. 33\u201340. Available at http:\/\/dl.acm.org\/citation.cfm?id=1273501.","DOI":"10.1145\/1273496.1273501"},{"key":"e_1_3_5_4_1","doi-asserted-by":"crossref","unstructured":"B.W. Bader M.W. Berry and M. Browne Discussion tracking in Enron email using PARAFAC in Survey of Text Mining: Clustering Classification and Retrieval M.W. Berry and M. Castellanos eds. 2nd ed. Springer New York 2007 pp. 147\u2013162 (Chapter 8).","DOI":"10.1007\/978-1-84800-046-9_8"},{"key":"e_1_3_5_5_1","unstructured":"B.W. Bader T.G. Kolda et al. MATLAB Tensor Toolbox Version 2.5 preprint (2012). Available at http:\/\/www.sandia.gov\/~tgkolda\/TensorToolbox\/http:\/\/www.sandia.gov\/\u223ctgkolda\/TensorToolbox\/."},{"key":"e_1_3_5_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1976.1101194"},{"key":"e_1_3_5_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0320018"},{"key":"e_1_3_5_8_1","unstructured":"R. Bro Multi-way analysis in the food industry: Models algorithms and applications Ph.D. thesis Universiteit van Amsterdam 1998."},{"key":"e_1_3_5_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-128X(199709\/10)11:5<393::AID-CEM483>3.0.CO;2-L"},{"key":"e_1_3_5_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0916069"},{"key":"e_1_3_5_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_3_5_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859063"},{"key":"e_1_3_5_13_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.708"},{"key":"e_1_3_5_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0725029"},{"key":"e_1_3_5_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921636"},{"key":"e_1_3_5_16_1","first-page":"631","article-title":"Computing nonnegative tensor factorizations","volume":"23","author":"Friedlander M.P.","year":"2008","unstructured":"M.P. Friedlander and K. Hatz, Computing nonnegative tensor factorizations, Comput. Optim. Appl. 23 (2008), pp. 631\u2013647.","journal-title":"Comput. Optim. Appl."},{"key":"e_1_3_5_17_1","unstructured":"E. Gonzalez and Y. Zhang Accelerating the Lee\u2013Seung algorithm for non-negative matrix factorization Tech. Rep. TR-05-02 Department of Computational and Applied Mathematics Rice University Houston TX 2005."},{"key":"e_1_3_5_18_1","unstructured":"R.A. Harshman Foundations of the PARAFAC procedure: Models and conditions for an \u2018explanatory\u2019 multi-modal factor analysis UCLA Working Papers in Phonetics 16 1970. Available at http:\/\/publish.uwo.ca\/~harshman\/wpppfac0.pdfhttp:\/\/publish.uwo.ca\/\u223charshman\/wpppfac0.pdf."},{"key":"e_1_3_5_19_1","doi-asserted-by":"crossref","unstructured":"C.-J. Hsieh and I.S. Dhillon Fast Coordinate Descent Methods with Variable Selection for Non-negative Matrix Factorization Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining San Diego CA ACM 2011 pp. 1064\u20131072. Available at http:\/\/dl.acm.org\/citation.cfm?id=2020577.","DOI":"10.1145\/2020408.2020577"},{"key":"e_1_3_5_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"e_1_3_5_21_1","doi-asserted-by":"crossref","unstructured":"J. Kim and H. Park Fast nonnegative tensor factorization with an active-set-like method in High-Performance Scientific Computing Algorithms and Applications M.W. Berry K.A. Gallivan E. Gallopoulos A. Grama B. Philippe Y. Saad and F. Saied eds. Springer-Verlag London 2012 pp. 311\u2013326.","DOI":"10.1007\/978-1-4471-2437-5_16"},{"key":"e_1_3_5_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.104"},{"key":"e_1_3_5_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073812X"},{"key":"e_1_3_5_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_5_25_1","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"e_1_3_5_26_1","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume":"13","author":"Lee D.D.","year":"2001","unstructured":"D.D. Lee and H.S. Seung, Algorithms for non-negative matrix factorization, Adv. Neural Inform. Process. Syst. 13 (2001), pp. 556\u2013562.","journal-title":"Adv. Neural Inform. Process. Syst."},{"key":"e_1_3_5_27_1","doi-asserted-by":"crossref","unstructured":"M. Ley The DBLP Computer Science Bibliography: Evolution Research Issues Perspectives Proceedings of the 9th International Symposium on String Processing and Information Retrieval Vol. 2476 2002 pp. 1\u201310. Available at http:\/\/www.informatik.uni-trier.de\/~ley\/db\/.","DOI":"10.1007\/3-540-45735-6_1"},{"key":"e_1_3_5_28_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"e_1_3_5_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.05.015"},{"key":"e_1_3_5_30_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0572855-7"},{"key":"e_1_3_5_31_1","unstructured":"J. Nocedal and S.J. Wright Numerical Optimization 2nd ed. Springer New York 2006."},{"key":"e_1_3_5_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(97)00031-2"},{"key":"e_1_3_5_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"e_1_3_5_34_1","doi-asserted-by":"crossref","unstructured":"A.-H. Phan A. Cichocki R. Zdunek and T. Dinh Novel alternating least squares algorithm for nonnegative matrix and tensor factorizations in Neural Information Processing. Theory and Algorithms K.W. Wong B.S.U. Mendis and A. Bouzerdoum eds. Lecture Notes in Computer Science Vol. 6443 Springer Berlin 2010 pp. 262\u2013269.","DOI":"10.1007\/978-3-642-17537-4_33"},{"key":"e_1_3_5_35_1","doi-asserted-by":"crossref","unstructured":"A.-H. Phan P. Tichavsky and A. Cichocki Fast Damped Gauss-Newton Algorithm for Sparse and Nonnegative Tensor Factorization in 2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP) Prague 2011 pp. 1988\u20131991.","DOI":"10.1109\/ICASSP.2011.5946900"},{"key":"e_1_3_5_36_1","doi-asserted-by":"crossref","unstructured":"M. Schmidt D. Kim and S. Sra Projected Newton-type methods in machine learning in Optimization for Machine Learning S. Sra S. Nowozin and S.J. Wright eds. MIT Press Cambridge MA 2011 pp. 305\u2013330.","DOI":"10.7551\/mitpress\/8996.003.0013"},{"key":"e_1_3_5_37_1","doi-asserted-by":"crossref","unstructured":"J. Sun D. Tao and C. Faloutsos Beyond Streams and Graphs: Dynamic Tensor Analysis in KDD '06 Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining Philadelphia PA ACM 2006 pp. 374\u2013383. Available at http:\/\/dl.acm.org\/citation.cfm?id=1150445.","DOI":"10.1145\/1150402.1150445"},{"key":"e_1_3_5_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2004.11.013"},{"key":"e_1_3_5_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/070709967"},{"key":"e_1_3_5_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00070-8"},{"key":"e_1_3_5_41_1","doi-asserted-by":"crossref","unstructured":"Y. Xu and W. Yin A block coordinate descent method for multi-convex optimization with applications to nonnegative tensor factorization and completion Tech. Rep. 12-15 CAAM Rice University Houston TX 2012.","DOI":"10.21236\/ADA567404"},{"key":"e_1_3_5_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0196-4"},{"key":"e_1_3_5_43_1","doi-asserted-by":"crossref","unstructured":"R. Zdunek and A. Cichocki Non-negative Matrix Factorization with Quasi-Newton Optimization in Eighth International Conference on Artificial Intelligence and Soft Computing ICAISC Springer Zakopane 2006 pp. 870\u2013879.","DOI":"10.1007\/11785231_91"},{"key":"e_1_3_5_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2007.01.024"},{"key":"e_1_3_5_45_1","doi-asserted-by":"publisher","DOI":"10.4304\/jsw.5.8.899-906"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2015.1009977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T18:21:04Z","timestamp":1770402064000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2015.1009977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,30]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9,3]]}},"alternative-id":["10.1080\/10556788.2015.1009977"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2015.1009977","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,30]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2013-12-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-01-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}