{"id":"https://openalex.org/W2096437719","doi":"https://doi.org/10.1109/icassp.2011.5947239","title":"Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize","display_name":"Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2096437719","doi":"https://doi.org/10.1109/icassp.2011.5947239","mag":"2096437719"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2011.5947239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2011.5947239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063265120","display_name":"Jean\u2010Philip Royer","orcid":null},"institutions":[{"id":"https://openalex.org/I4210106479","display_name":"Laboratoire d'Informatique, Signaux et Syst\u00e8mes de Sophia Antipolis","ror":"https://ror.org/01215r597","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106479","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Philip Royer","raw_affiliation_strings":["I3S, Sophia-Antipolis, France","I3S, Algorithmes/Euclide-B, 2000 route des Lucioles, BP 121, F-06903, Sophia Antipolis Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"I3S, Sophia-Antipolis, France","institution_ids":["https://openalex.org/I4210106479"]},{"raw_affiliation_string":"I3S, Algorithmes/Euclide-B, 2000 route des Lucioles, BP 121, F-06903, Sophia Antipolis Cedex, France","institution_ids":["https://openalex.org/I4210106479"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033972557","display_name":"Pierre Comon","orcid":"https://orcid.org/0000-0001-9436-9228"},"institutions":[{"id":"https://openalex.org/I4210106479","display_name":"Laboratoire d'Informatique, Signaux et Syst\u00e8mes de Sophia Antipolis","ror":"https://ror.org/01215r597","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106479","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pierre Comon","raw_affiliation_strings":["I3S, Sophia-Antipolis, France","I3S, Algorithmes/Euclide-B, 2000 route des Lucioles, BP 121, F-06903, Sophia Antipolis Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"I3S, Sophia-Antipolis, France","institution_ids":["https://openalex.org/I4210106479"]},{"raw_affiliation_string":"I3S, Algorithmes/Euclide-B, 2000 route des Lucioles, BP 121, F-06903, Sophia Antipolis Cedex, France","institution_ids":["https://openalex.org/I4210106479"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110603905","display_name":"Nad\u00e8ge Thirion\u2010Moreau","orcid":"https://orcid.org/0000-0002-9245-3407"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I143002897","display_name":"Universit\u00e9 de Toulon","ror":"https://ror.org/02m9kbe37","country_code":"FR","type":"education","lineage":["https://openalex.org/I143002897"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nadege Thirion-Moreau","raw_affiliation_strings":["ISITV, LSEET, UMR CNRS 6017, Universit\u00e9 du Sud Toulon Var, La Garde, France","ISITV, LSEET, UMR CNRS 6017, Universit\u00e9 du Sud Toulon Var, F-83957, La Garde C\u00e9dex, France,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISITV, LSEET, UMR CNRS 6017, Universit\u00e9 du Sud Toulon Var, La Garde, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I143002897"]},{"raw_affiliation_string":"ISITV, LSEET, UMR CNRS 6017, Universit\u00e9 du Sud Toulon Var, F-83957, La Garde C\u00e9dex, France,","institution_ids":["https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7543,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.54022989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"4040","last_page":"4043"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.8120678663253784},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6705050468444824},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5794868469238281},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5435625314712524},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5348604321479797},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5075172185897827},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.5062436461448669},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.48273178935050964},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.48119884729385376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4784258008003235},{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.470575749874115},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.46740418672561646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4527946710586548},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45145994424819946},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.4468030333518982},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.44453415274620056},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.23702102899551392},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13818418979644775},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1234065592288971},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1147194504737854}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.8120678663253784},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6705050468444824},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5794868469238281},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5435625314712524},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5348604321479797},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5075172185897827},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.5062436461448669},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.48273178935050964},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.48119884729385376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4784258008003235},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.470575749874115},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.46740418672561646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4527946710586548},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45145994424819946},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.4468030333518982},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.44453415274620056},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.23702102899551392},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13818418979644775},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1234065592288971},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1147194504737854},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2011.5947239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2011.5947239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1246381107","https://openalex.org/W1537335979","https://openalex.org/W2007449884","https://openalex.org/W2025603201","https://openalex.org/W2027559251","https://openalex.org/W2043044533","https://openalex.org/W2048922416","https://openalex.org/W2056790378","https://openalex.org/W2119741678","https://openalex.org/W2172195418","https://openalex.org/W2258054274","https://openalex.org/W2296319761","https://openalex.org/W2404400936","https://openalex.org/W2490308495","https://openalex.org/W2491347989","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W2356977358","https://openalex.org/W4291138102","https://openalex.org/W4319027779","https://openalex.org/W2183734858","https://openalex.org/W2005717169","https://openalex.org/W3131790919","https://openalex.org/W2375129592","https://openalex.org/W2382015157","https://openalex.org/W2941778027","https://openalex.org/W2098528027"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3],"the":[4,27,41,45,50,54,64,76,89,98],"minimal":[5],"polyadic":[6],"decomposition":[7,12,65],"(also":[8],"known":[9],"as":[10],"canonical":[11],"or":[13],"Parafac)":[14],"of":[15,37,44,88,100],"a":[16],"3-way":[17],"array,":[18],"assuming":[19],"each":[20],"entry":[21],"is":[22,92],"positive.":[23],"In":[24,70],"this":[25],"case,":[26,72],"low-rank":[28],"approximation":[29],"problem":[30,51],"becomes":[31],"well-posed.":[32],"The":[33,85],"suggested":[34],"approach":[35,91],"consists":[36],"taking":[38],"into":[39],"account":[40],"nonnegative":[42],"nature":[43],"loading":[46],"matrices":[47],"directly":[48],"in":[49,97],"parameterization.":[52],"Then,":[53],"three":[55],"gradient":[56,78],"components":[57],"are":[58],"derived":[59],"allowing":[60],"to":[61,82,105],"efficiently":[62],"implement":[63],"using":[66],"classical":[67],"optimization":[68],"algorithms.":[69],"our":[71],"we":[73],"focus":[74],"on":[75],"conjugate":[77],"algorithm,":[79],"well":[80],"matched":[81],"large":[83],"problems.":[84],"good":[86],"behaviour":[87],"proposed":[90],"illustrated":[93],"through":[94],"computer":[95],"simulations":[96],"context":[99],"data":[101],"analysis":[102],"and":[103],"compared":[104],"other":[106],"existing":[107],"approaches.":[108]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}