{"id":"https://openalex.org/W4405209840","doi":"https://doi.org/10.1137/24m1650600","title":"Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization","display_name":"Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization","publication_year":2024,"publication_date":"2024-12-10","ids":{"openalex":"https://openalex.org/W4405209840","doi":"https://doi.org/10.1137/24m1650600"},"language":"en","primary_location":{"id":"doi:10.1137/24m1650600","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1650600","pdf_url":null,"source":{"id":"https://openalex.org/S152600803","display_name":"SIAM Journal on Imaging Sciences","issn_l":"1936-4954","issn":["1936-4954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Imaging Sciences","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/49485/1/86%20Dual%20Simplex%20Volume%20Maximization%20for%20Simplex-Structured%20Matrix%20Factorization.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066172140","display_name":"Maryam Abdolali","orcid":"https://orcid.org/0000-0001-7032-4498"},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Maryam Abdolali","raw_affiliation_strings":["K. N. Toosi University (KNTU), Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"K. N. Toosi University (KNTU), Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035554643","display_name":"Giovanni Barbarino","orcid":"https://orcid.org/0000-0003-0504-7361"},"institutions":[{"id":"https://openalex.org/I2802148964","display_name":"Istituto Nazionale di Alta Matematica Francesco Severi","ror":"https://ror.org/01vx64p53","country_code":"IT","type":"funder","lineage":["https://openalex.org/I2802148964"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giovanni Barbarino","raw_affiliation_strings":["University of Mons, Mons, Belgium.\u00a0GB is a member of the Research Group GNCS ruppo Nazionale per il Calcolo Scientificoof INdAM stituto Nazionale di Alta Matematica"],"raw_orcid":"https://orcid.org/0000-0003-0504-7361","affiliations":[{"raw_affiliation_string":"University of Mons, Mons, Belgium.\u00a0GB is a member of the Research Group GNCS ruppo Nazionale per il Calcolo Scientificoof INdAM stituto Nazionale di Alta Matematica","institution_ids":["https://openalex.org/I2802148964"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040368041","display_name":"Nicolas Gillis","orcid":"https://orcid.org/0000-0001-6423-6897"},"institutions":[{"id":"https://openalex.org/I2802148964","display_name":"Istituto Nazionale di Alta Matematica Francesco Severi","ror":"https://ror.org/01vx64p53","country_code":"IT","type":"funder","lineage":["https://openalex.org/I2802148964"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicolas Gillis","raw_affiliation_strings":["University of Mons, Mons, Belgium.\u00a0GB is a member of the Research Group GNCS ruppo Nazionale per il Calcolo Scientificoof INdAM stituto Nazionale di Alta Matematica"],"raw_orcid":"https://orcid.org/0000-0001-6423-6897","affiliations":[{"raw_affiliation_string":"University of Mons, Mons, Belgium.\u00a0GB is a member of the Research Group GNCS ruppo Nazionale per il Calcolo Scientificoof INdAM stituto Nazionale di Alta Matematica","institution_ids":["https://openalex.org/I2802148964"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.305,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5452635,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"17","issue":"4","first_page":"2362","last_page":"2391"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9970999956130981,"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"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/simplex","display_name":"Simplex","score":0.7817850112915039},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5762977004051208},{"id":"https://openalex.org/keywords/volume","display_name":"Volume (thermodynamics)","score":0.5662583708763123},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5419143438339233},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5144946575164795},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.49825191497802734},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47546666860580444},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4680008292198181},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.46645134687423706},{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.448264479637146},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.44089072942733765},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40614181756973267},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33236968517303467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28564587235450745},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2757880985736847},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.26992037892341614},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19558778405189514},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.16551724076271057},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.08571526408195496}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7817850112915039},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5762977004051208},{"id":"https://openalex.org/C20556612","wikidata":"https://www.wikidata.org/wiki/Q4469374","display_name":"Volume (thermodynamics)","level":2,"score":0.5662583708763123},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5419143438339233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5144946575164795},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.49825191497802734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47546666860580444},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4680008292198181},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.46645134687423706},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.448264479637146},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.44089072942733765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40614181756973267},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33236968517303467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28564587235450745},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2757880985736847},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26992037892341614},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19558778405189514},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.16551724076271057},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.08571526408195496},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/24m1650600","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1650600","pdf_url":null,"source":{"id":"https://openalex.org/S152600803","display_name":"SIAM Journal on Imaging Sciences","issn_l":"1936-4954","issn":["1936-4954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Imaging Sciences","raw_type":"journal-article"},{"id":"pmh:oai:orbi.umons.ac.be:20.500.12907/49485","is_oa":true,"landing_page_url":"https://orbi.umons.ac.be/handle/20.500.12907/49485","pdf_url":"https://orbi.umons.ac.be/bitstream/20.500.12907/49485/1/86%20Dual%20Simplex%20Volume%20Maximization%20for%20Simplex-Structured%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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Imaging Sciences, 17 (4), 2362-2391 (2024-12-10)","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"pmh:oai:orbi.umons.ac.be:20.500.12907/49485","is_oa":true,"landing_page_url":"https://orbi.umons.ac.be/handle/20.500.12907/49485","pdf_url":"https://orbi.umons.ac.be/bitstream/20.500.12907/49485/1/86%20Dual%20Simplex%20Volume%20Maximization%20for%20Simplex-Structured%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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Imaging Sciences, 17 (4), 2362-2391 (2024-12-10)","raw_type":"http://purl.org/coar/resource_type/c_6501"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G283579603","display_name":null,"funder_award_id":"101085607","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G5092193842","display_name":null,"funder_award_id":"101085607","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"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/W4405209840.pdf","grobid_xml":"https://content.openalex.org/works/W4405209840.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1902027874","https://openalex.org/W1982755765","https://openalex.org/W2050041778","https://openalex.org/W2050968963","https://openalex.org/W2063790512","https://openalex.org/W2070135644","https://openalex.org/W2101837437","https://openalex.org/W2118943995","https://openalex.org/W2125860481","https://openalex.org/W2127062304","https://openalex.org/W2129062845","https://openalex.org/W2129354191","https://openalex.org/W2145962650","https://openalex.org/W2163886442","https://openalex.org/W2166630570","https://openalex.org/W2245855345","https://openalex.org/W2791154158","https://openalex.org/W2802755718","https://openalex.org/W2964085075","https://openalex.org/W2964257934","https://openalex.org/W3045088271","https://openalex.org/W3085097441","https://openalex.org/W3099513518","https://openalex.org/W3100202987","https://openalex.org/W3106127686","https://openalex.org/W3114089334","https://openalex.org/W3122766110","https://openalex.org/W3157795203","https://openalex.org/W3200589144","https://openalex.org/W4206519735"],"related_works":["https://openalex.org/W2127243424","https://openalex.org/W4390394189","https://openalex.org/W2037504162","https://openalex.org/W2539013788","https://openalex.org/W2792706544","https://openalex.org/W1568451138","https://openalex.org/W2156699640","https://openalex.org/W2166485459","https://openalex.org/W2045265907","https://openalex.org/W2972997031"],"abstract_inverted_index":{"Abstract.":[0],"Simplex-structured":[1],"matrix":[2,9],"factorization":[3],"(SSMF),":[4],"closely":[5],"related":[6],"to":[7,35,56,80,114],"nonnegative":[8],"factorization,":[10],"is":[11,34],"a":[12,31,57,82],"fundamental":[13],"interpretable":[14],"data":[15],"analysis":[16],"model":[17],"and":[18,24,101],"has":[19],"applications":[20],"in":[21,52,60],"hyperspectral":[22],"unmixing":[23],"topic":[25],"modeling.":[26],"To":[27],"obtain":[28],"identifiable":[29],"solutions,":[30],"standard":[32],"approach":[33,85,110],"find":[36],"minimum-volume":[37,50],"solutions.":[38],"By":[39],"taking":[40],"advantage":[41],"of":[42,69,94],"the":[43,53,61,67,88,108,115],"duality/polarity":[44],"concept":[45],"for":[46,96],"polytopes,":[47],"we":[48,75],"convert":[49],"SSMF":[51,117],"primal":[54],"space":[55],"maximum-volume":[58,71],"problem":[59],"dual":[62,72,78],"space.":[63],"We":[64],"first":[65],"prove":[66],"identifiability":[68],"this":[70,77],"problem.":[73],"Then,":[74],"use":[76],"formulation":[79],"provide":[81],"novel":[83],"optimization":[84],"which":[86],"bridges":[87],"gap":[89],"between":[90],"two":[91],"existing":[92],"families":[93],"algorithms":[95],"SSMF,":[97],"namely":[98],"volume":[99],"minimization":[100],"facet":[102],"identification.":[103],"Numerical":[104],"experiments":[105],"show":[106],"that":[107],"proposed":[109],"performs":[111],"favorably":[112],"compared":[113],"state-of-the-art":[116],"algorithms.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2024-12-11T00:00:00"}