{"id":"https://openalex.org/W2523548419","doi":"https://doi.org/10.1142/s0129626416500146","title":"Parallel Nonnegative Matrix Factorization via Newton Iteration","display_name":"Parallel Nonnegative Matrix Factorization via Newton Iteration","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2523548419","doi":"https://doi.org/10.1142/s0129626416500146","mag":"2523548419"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626416500146","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626416500146","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","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/A5085161522","display_name":"Markus Flatz","orcid":null},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Markus Flatz","raw_affiliation_strings":["Department of Computer Sciences, University of Salzburg, Jakob-Haringer-Str. 2, 5020 Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Salzburg, Jakob-Haringer-Str. 2, 5020 Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022662194","display_name":"Mari\u00e1n Vajter\u0161ic","orcid":null},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]},{"id":"https://openalex.org/I207624831","display_name":"Slovak Academy of Sciences","ror":"https://ror.org/03h7qq074","country_code":"SK","type":"government","lineage":["https://openalex.org/I207624831"]},{"id":"https://openalex.org/I4210120676","display_name":"Mathematical Institute of the Slovak Academy of Sciences","ror":"https://ror.org/02fhy7464","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210120676"]}],"countries":["AT","SK"],"is_corresponding":false,"raw_author_name":"Mari\u00e1n Vajter\u0161ic","raw_affiliation_strings":["Department of Computer Sciences, University of Salzburg, Jakob-Haringer-Str. 2, 5020 Salzburg, Austria","Mathematical Institute, Department of Informatics, Slovak Academy of Sciences, D\u00fabravsk\u00e1 cesta 9, 841 04 Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Salzburg, Jakob-Haringer-Str. 2, 5020 Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]},{"raw_affiliation_string":"Mathematical Institute, Department of Informatics, Slovak Academy of Sciences, D\u00fabravsk\u00e1 cesta 9, 841 04 Bratislava, Slovakia","institution_ids":["https://openalex.org/I207624831","https://openalex.org/I4210120676"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0814,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80861188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"26","issue":"03","first_page":"1650014","last_page":"1650014"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9815000295639038,"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/T10320","display_name":"Neural Networks and Applications","score":0.9638000130653381,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.9227815866470337},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7808983325958252},{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.7296110391616821},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5438708066940308},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5128762722015381},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.5127063989639282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5060979723930359},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.4932183623313904},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4825288951396942},{"id":"https://openalex.org/keywords/nonnegative-matrix","display_name":"Nonnegative matrix","score":0.4711177349090576},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4592902362346649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43680667877197266},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.40514808893203735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3797599673271179},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3176835775375366},{"id":"https://openalex.org/keywords/symmetric-matrix","display_name":"Symmetric matrix","score":0.1947782337665558},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.07865101099014282}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.9227815866470337},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7808983325958252},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.7296110391616821},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5438708066940308},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5128762722015381},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5127063989639282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5060979723930359},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.4932183623313904},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4825288951396942},{"id":"https://openalex.org/C139018669","wikidata":"https://www.wikidata.org/wiki/Q6961560","display_name":"Nonnegative matrix","level":4,"score":0.4711177349090576},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4592902362346649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43680667877197266},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.40514808893203735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3797599673271179},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3176835775375366},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.1947782337665558},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.07865101099014282},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626416500146","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626416500146","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320312330","display_name":"Slovensk\u00e1 Akad\u00e9mia Vied","ror":"https://ror.org/03h7qq074"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1902027874","https://openalex.org/W2017288758","https://openalex.org/W2059745395","https://openalex.org/W2080728047","https://openalex.org/W2092423825","https://openalex.org/W2113359929","https://openalex.org/W2118718620","https://openalex.org/W2136787567","https://openalex.org/W2142621404"],"related_works":["https://openalex.org/W2289207566","https://openalex.org/W2109622866","https://openalex.org/W2387058857","https://openalex.org/W2088770317","https://openalex.org/W2012642013","https://openalex.org/W2166191203","https://openalex.org/W2991398534","https://openalex.org/W2165495021","https://openalex.org/W1845372869","https://openalex.org/W2091334405"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,21],"Nonnegative":[3],"Matrix":[4],"Factorization":[5],"(NMF)":[6],"is":[7,54],"to":[8],"represent":[9],"a":[10,19],"large":[11],"nonnegative":[12,25],"matrix":[13],"in":[14,30],"an":[15,33],"approximate":[16],"way":[17],"as":[18],"product":[20],"two":[22],"significantly":[23],"smaller":[24],"matrices.":[26],"This":[27,52],"paper":[28],"shows":[29],"detail":[31],"how":[32],"NMF":[34],"algorithm":[35,53],"based":[36],"on":[37,59],"Newton":[38],"iteration":[39],"can":[40],"be":[41],"derived":[42],"using":[43],"the":[44],"general":[45],"Karush-Kuhn-Tucker":[46],"(KKT)":[47],"conditions":[48],"for":[49,56],"first-order":[50],"optimality.":[51],"suited":[55],"parallel":[57],"execution":[58],"systems":[60],"with":[61,66],"shared":[62],"memory":[63],"and":[64,73],"also":[65],"message":[67],"passing.":[68],"Both":[69],"versions":[70],"were":[71],"implemented":[72],"tested,":[74],"delivering":[75],"satisfactory":[76],"speedup":[77],"results.":[78]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
