{"id":"https://openalex.org/W2053479878","doi":"https://doi.org/10.1137/070680436","title":"Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization","display_name":"Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2053479878","doi":"https://doi.org/10.1137/070680436","mag":"2053479878"},"language":"en","primary_location":{"id":"doi:10.1137/070680436","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070680436","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","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/A5029654954","display_name":"Moody T. Chu","orcid":"https://orcid.org/0000-0001-8544-3588"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Moody T. Chu","raw_affiliation_strings":["chu@math.ncsu.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"chu@math.ncsu.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080854365","display_name":"Matthew M. Lin","orcid":"https://orcid.org/0000-0002-8144-947X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthew M. Lin","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029654954"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6209,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.89630877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"3","first_page":"1131","last_page":"1155"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9947999715805054,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9947999715805054,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9939000010490417,"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/T10057","display_name":"Face and Expression Recognition","score":0.9907000064849854,"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/mathematics","display_name":"Mathematics","score":0.830764889717102},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.744134783744812},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6500670909881592},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.5393602252006531},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5269770622253418},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.4989662170410156},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.45595860481262207},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4446165859699249},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.4388582408428192},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.41279205679893494},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3789931535720825},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.15078890323638916},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.10823920369148254},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.10428434610366821},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09402704238891602},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.08750355243682861}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.830764889717102},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.744134783744812},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6500670909881592},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.5393602252006531},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5269770622253418},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.4989662170410156},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.45595860481262207},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4446165859699249},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.4388582408428192},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.41279205679893494},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3789931535720825},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.15078890323638916},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.10823920369148254},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.10428434610366821},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09402704238891602},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.08750355243682861},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070680436","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070680436","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1533128638","https://openalex.org/W1540772925","https://openalex.org/W1826624540","https://openalex.org/W1902027874","https://openalex.org/W1980801609","https://openalex.org/W1992586477","https://openalex.org/W2010244298","https://openalex.org/W2022018373","https://openalex.org/W2041138935","https://openalex.org/W2056857971","https://openalex.org/W2059745395","https://openalex.org/W2081300775","https://openalex.org/W2094911742","https://openalex.org/W2099120557","https://openalex.org/W2146913572","https://openalex.org/W2164436391","https://openalex.org/W2166282318"],"related_works":["https://openalex.org/W3023661894","https://openalex.org/W4297887964","https://openalex.org/W2797568024","https://openalex.org/W4297613789","https://openalex.org/W2952440447","https://openalex.org/W1553242510","https://openalex.org/W3149883346","https://openalex.org/W1642182499","https://openalex.org/W2953076628","https://openalex.org/W2085110259"],"abstract_inverted_index":{"In":[0,53],"this":[1,135],"study,":[2],"nonnegative":[3,142],"matrix":[4,143],"factorization":[5],"is":[6,104],"recast":[7],"as":[8],"the":[9,16,27,31,50,55,70,89,107],"problem":[10],"of":[11,87],"approximating":[12],"a":[13,38,42,60,63,66,84,118,122,138],"polytope":[14,21],"on":[15,26],"probability":[17,28],"simplex":[18,29],"by":[19,69],"another":[20],"with":[22,41],"fewer":[23,146],"facets.":[24],"Working":[25],"has":[30],"advantage":[32],"that":[33,58,134],"data":[34],"are":[35],"limited":[36],"to":[37,48,83,95],"compact":[39],"set":[40],"known":[43],"boundary,":[44],"making":[45],"it":[46],"easier":[47],"trace":[49],"approximation":[51,144],"procedure.":[52],"particular,":[54],"supporting":[56],"hyperplane":[57],"separates":[59],"point":[61],"from":[62],"disjoint":[64],"polytope,":[65],"fact":[67],"asserted":[68],"Hahn\u2013Banach":[71],"theorem,":[72],"can":[73],"be":[74],"calculated":[75],"in":[76,93,145],"finitely":[77],"many":[78],"steps.":[79],"This":[80,114],"approach":[81,136],"leads":[82],"convenient":[85],"way":[86],"computing":[88],"proximity":[90],"map":[91,103],"which,":[92],"contrast":[94],"most":[96],"existing":[97],"algorithms":[98],"where":[99],"only":[100],"an":[101,127],"approximate":[102],"used,":[105],"finds":[106],"unique":[108],"and":[109,125],"global":[110],"minimum":[111],"per":[112],"iteration.":[113],"paper":[115],"sets":[116],"up":[117],"theoretical":[119],"framework,":[120],"outlines":[121],"numerical":[123],"algorithm,":[124],"suggests":[126],"effective":[128],"implementation.":[129],"Testing":[130],"results":[131],"strongly":[132],"evidence":[133],"obtains":[137],"better":[139],"low":[140],"rank":[141],"steps":[147],"than":[148],"conventional":[149],"methods.":[150]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}