{"id":"https://openalex.org/W4366823049","doi":"https://doi.org/10.1080/10556788.2023.2189714","title":"Conic optimization-based algorithms for nonnegative matrix factorization","display_name":"Conic optimization-based algorithms for nonnegative matrix factorization","publication_year":2023,"publication_date":"2023-04-24","ids":{"openalex":"https://openalex.org/W4366823049","doi":"https://doi.org/10.1080/10556788.2023.2189714"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2023.2189714","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2189714","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbi.umons.ac.be/bitstream/20.500.12907/45249/1/78%20Conic-Optimization%20Based%20Algorithms%20for%20Nonnegative%20Matrix%20Factorization.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047260409","display_name":"Valentin Leplat","orcid":"https://orcid.org/0000-0002-3313-1547"},"institutions":[{"id":"https://openalex.org/I125989756","display_name":"Skolkovo Institute of Science and Technology","ror":"https://ror.org/03f9nc143","country_code":"RU","type":"education","lineage":["https://openalex.org/I125989756"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Valentin Leplat","raw_affiliation_strings":["Center for Artificial Intelligence Technology, Skoltech, Moscow, Russia"],"raw_orcid":"https://orcid.org/0000-0002-3313-1547","affiliations":[{"raw_affiliation_string":"Center for Artificial Intelligence Technology, Skoltech, Moscow, Russia","institution_ids":["https://openalex.org/I125989756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067792459","display_name":"Yurii Nesterov","orcid":"https://orcid.org/0000-0002-0542-8757"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Yurii Nesterov","raw_affiliation_strings":["CORE and ICTEAM/Mathematical Engineering (INMA), UCLouvain, Belgium"],"raw_orcid":"https://orcid.org/0000-0002-0542-8757","affiliations":[{"raw_affiliation_string":"CORE and ICTEAM/Mathematical Engineering (INMA), UCLouvain, Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040368041","display_name":"Nicolas Gillis","orcid":"https://orcid.org/0000-0001-6423-6897"},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Nicolas Gillis","raw_affiliation_strings":["Department of Mathematics and Operational Research, Facult\u00e9 Polytechnique, Universit\u00e9 de Mons, Mons, Belgium"],"raw_orcid":"https://orcid.org/0000-0001-6423-6897","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Operational Research, Facult\u00e9 Polytechnique, Universit\u00e9 de Mons, Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038754080","display_name":"Fran\u00e7ois Glineur","orcid":"https://orcid.org/0000-0002-5890-1093"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois Glineur","raw_affiliation_strings":["CORE and ICTEAM/Mathematical Engineering (INMA), UCLouvain, Belgium"],"raw_orcid":"https://orcid.org/0000-0002-5890-1093","affiliations":[{"raw_affiliation_string":"CORE and ICTEAM/Mathematical Engineering (INMA), UCLouvain, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040368041"],"corresponding_institution_ids":["https://openalex.org/I130929987"],"apc_list":null,"apc_paid":null,"fwci":0.2848,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55166967,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"38","issue":"4","first_page":"837","last_page":"859"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T12303","display_name":"Tensor decomposition and applications","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.7090661525726318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6398841738700867},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.6363458037376404},{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.6041619777679443},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.58197420835495},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5569100379943848},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5090481638908386},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.4533866345882416},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4523313343524933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4483475089073181},{"id":"https://openalex.org/keywords/majorization","display_name":"Majorization","score":0.4396193027496338},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.39721983671188354},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3695570230484009},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3506808578968048},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.30177122354507446},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.29816460609436035},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.12893885374069214}],"concepts":[{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.7090661525726318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6398841738700867},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.6363458037376404},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.6041619777679443},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.58197420835495},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5569100379943848},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5090481638908386},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.4533866345882416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4523313343524933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4483475089073181},{"id":"https://openalex.org/C2777818330","wikidata":"https://www.wikidata.org/wiki/Q1994695","display_name":"Majorization","level":2,"score":0.4396193027496338},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.39721983671188354},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3695570230484009},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3506808578968048},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.30177122354507446},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.29816460609436035},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.12893885374069214},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","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":3,"locations":[{"id":"doi:10.1080/10556788.2023.2189714","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2189714","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:orbi.umons.ac.be:20.500.12907/45249","is_oa":true,"landing_page_url":"https://orbi.umons.ac.be/handle/20.500.12907/45249","pdf_url":"https://orbi.umons.ac.be/bitstream/20.500.12907/45249/1/78%20Conic-Optimization%20Based%20Algorithms%20for%20Nonnegative%20Matrix%20Factorization.pdf","source":{"id":"https://openalex.org/S7407055454","display_name":"ORBi UMONS","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Methods and Software, 38 (4), 837-859 (2023-03-01)","raw_type":"http://purl.org/coar/resource_type/c_6501"},{"id":"pmh:oai:dial.uclouvain.be:boreal:277136","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/277136","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Methods and Software, Vol. 38, no.4, p. 837-859 (2023)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:orbi.umons.ac.be:20.500.12907/45249","is_oa":true,"landing_page_url":"https://orbi.umons.ac.be/handle/20.500.12907/45249","pdf_url":"https://orbi.umons.ac.be/bitstream/20.500.12907/45249/1/78%20Conic-Optimization%20Based%20Algorithms%20for%20Nonnegative%20Matrix%20Factorization.pdf","source":{"id":"https://openalex.org/S7407055454","display_name":"ORBi UMONS","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Methods and Software, 38 (4), 837-859 (2023-03-01)","raw_type":"http://purl.org/coar/resource_type/c_6501"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1619056545","display_name":null,"funder_award_id":"O005318F-RG47","funder_id":"https://openalex.org/F4320321730","funder_display_name":"Fonds Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G4023648257","display_name":null,"funder_award_id":"788368","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4654491315","display_name":null,"funder_award_id":"075.10.2021.068","funder_id":"https://openalex.org/F4320324442","funder_display_name":"Skolkovo Institute of Science and Technology"},{"id":"https://openalex.org/G5612754576","display_name":null,"funder_award_id":"O005318F-RG47","funder_id":"https://openalex.org/F4320321390","funder_display_name":"Fonds De La Recherche Scientifique - FNRS"},{"id":"https://openalex.org/G7634775220","display_name":null,"funder_award_id":"788368","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G8217562893","display_name":null,"funder_award_id":"075-10-2021-068","funder_id":"https://openalex.org/F4320322733","funder_display_name":"Ministerstwo Edukacji i Nauki"},{"id":"https://openalex.org/G8847044813","display_name":null,"funder_award_id":"679515","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"},{"id":"https://openalex.org/F4320322733","display_name":"Ministerstwo Edukacji i Nauki","ror":"https://ror.org/05dwvd537"},{"id":"https://openalex.org/F4320324442","display_name":"Skolkovo Institute of Science and Technology","ror":"https://ror.org/03f9nc143"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4366823049.pdf","grobid_xml":"https://content.openalex.org/works/W4366823049.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1504886279","https://openalex.org/W1802310826","https://openalex.org/W2032044862","https://openalex.org/W2093492509","https://openalex.org/W2102536337","https://openalex.org/W2108840817","https://openalex.org/W2109706083","https://openalex.org/W2124172487","https://openalex.org/W2136885855","https://openalex.org/W2151549243","https://openalex.org/W2152557171","https://openalex.org/W2404400936","https://openalex.org/W2507533531","https://openalex.org/W2626435674","https://openalex.org/W2784638391","https://openalex.org/W2791154158","https://openalex.org/W2963369852","https://openalex.org/W2964062052","https://openalex.org/W3100202987","https://openalex.org/W3104490375","https://openalex.org/W3114089334","https://openalex.org/W3127047037","https://openalex.org/W3203963792","https://openalex.org/W4302087481"],"related_works":["https://openalex.org/W2767431383","https://openalex.org/W1992995584","https://openalex.org/W2040223133","https://openalex.org/W2346229102","https://openalex.org/W1537899502","https://openalex.org/W4382519084","https://openalex.org/W2259817568","https://openalex.org/W3047013300","https://openalex.org/W21211370","https://openalex.org/W321335913"],"abstract_inverted_index":{"Nonnegative":[0],"matrix":[1,11],"factorization":[2,15],"is":[3,82,168],"the":[4,60,85,89,92,108,114,121,157,161,169,183,243,246],"following":[5],"problem:":[6],"given":[7],"a":[8,14,70,74,111,145,173,204],"nonnegative":[9,20],"input":[10],"V":[12,35,236],"and":[13,26,88,131,239],"rank":[16],"K,":[17],"compute":[18,231],"two":[19,45,62],"matrices,":[21],"W":[22],"with":[23,28,148,235,242],"K":[24,29,190],"columns":[25],"H":[27],"rows,":[30],"such":[31],"that":[32,141,195,209,224],"WH":[33],"approximates":[34],"as":[36,38,68,152,203],"well":[37],"possible.":[39],"In":[40],"this":[41],"paper,":[42],"we":[43,65,96,104,193,218],"propose":[44],"new":[46],"approaches":[47,57,143,226],"for":[48,179],"computing":[49],"high-quality":[50],"NMF":[51,67],"solutions":[52],"using":[53,136],"conic":[54,129],"optimization.":[55],"These":[56],"rely":[58],"on":[59,84,91,220],"same":[61],"steps.":[63],"First,":[64],"reformulate":[66],"minimizing":[69],"concave":[71],"function":[72],"over":[73,107],"product":[75],"of":[76,113,163,186,197,245],"convex":[77,128,205],"cones":[78],"\u2013":[79],"one":[80,196],"approach":[81],"based":[83],"exponential":[86],"cone":[87],"other":[90],"second-order":[93],"cone.":[94],"Then,":[95],"solve":[97],"these":[98,125],"reformulations":[99],"iteratively:":[100],"at":[101,120],"each":[102],"step,":[103],"minimize":[105],"exactly,":[106],"feasible":[109],"set,":[110],"majorization":[112],"objective":[115],"functions":[116],"obtained":[117],"via":[118],"linearization":[119],"current":[122],"iterate.":[123],"Hence":[124],"subproblems":[126],"are":[127,227],"programs":[130],"can":[132,200,213],"be":[133,201,214],"solved":[134],"efficiently":[135],"dedicated":[137],"algorithms.":[138],"We":[139],"prove":[140],"our":[142,164,166,198,225],"reach":[144],"stationary":[146,177],"point":[147],"an":[149],"accuracy":[150],"decreasing":[151],"O(1i),":[153],"where":[154],"i":[155],"denotes":[156],"iteration":[158],"number.":[159],"To":[160],"best":[162],"knowledge,":[165],"analysis":[167],"first":[170],"to":[171,176,229],"provide":[172],"convergence":[174],"rate":[175],"points":[178],"NMF.":[180],"Furthermore,":[181],"in":[182],"particular":[184],"cases":[185],"rank-1":[187,211],"factorizations":[188],"(i.e.":[189,234],"=":[191,237],"1),":[192],"show":[194,219],"formulations":[199],"expressed":[202],"optimization":[206],"problem,":[207],"implying":[208],"optimal":[210],"approximations":[212],"computed":[215],"efficiently.":[216],"Finally,":[217],"several":[221],"numerical":[222],"examples":[223],"able":[228],"frequently":[230],"exact":[232],"NMFs":[233],"WH)":[238],"compete":[240],"favourably":[241],"state":[244],"art.":[247]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}