{"id":"https://openalex.org/W2508997959","doi":"https://doi.org/10.1137/15m102825x","title":"Projection onto a Polyhedron that Exploits Sparsity","display_name":"Projection onto a Polyhedron that Exploits Sparsity","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2508997959","doi":"https://doi.org/10.1137/15m102825x","mag":"2508997959"},"language":"en","primary_location":{"id":"doi:10.1137/15m102825x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m102825x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","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/A5002362913","display_name":"William W. Hager","orcid":"https://orcid.org/0000-0003-3132-7017"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"William W. Hager","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101893795","display_name":"Hongchao Zhang","orcid":"https://orcid.org/0000-0003-2518-6975"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hongchao Zhang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002362913"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1938,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.91295294,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"26","issue":"3","first_page":"1773","last_page":"1798"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994999766349792,"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.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.8884594440460205},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.6712955236434937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6003903746604919},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5602679252624512},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5579638481140137},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5345973372459412},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5091139674186707},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5014355182647705},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5011312961578369},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4719756543636322},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.45888951420783997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3632168769836426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15635302662849426}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8884594440460205},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.6712955236434937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6003903746604919},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5602679252624512},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5579638481140137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5345973372459412},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5091139674186707},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5014355182647705},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5011312961578369},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4719756543636322},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.45888951420783997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3632168769836426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15635302662849426},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/15m102825x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m102825x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"},{"id":"pmh:oai:repository.lsu.edu:mathematics_pubs-2926","is_oa":false,"landing_page_url":"https://repository.lsu.edu/mathematics_pubs/1924","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[{"id":"https://openalex.org/G2170114997","display_name":null,"funder_award_id":"FA8651-08-D-0108","funder_id":"https://openalex.org/F4320332467","funder_display_name":"U.S. Air Force"},{"id":"https://openalex.org/G2193832229","display_name":null,"funder_award_id":"N00014-15-1-2048","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G2378547780","display_name":null,"funder_award_id":"N00014-11-1-0068","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G3509903425","display_name":null,"funder_award_id":"1522629","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5947214927","display_name":null,"funder_award_id":"1115568","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6050504816","display_name":null,"funder_award_id":"HR0011-12-C-0011","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G7258803696","display_name":null,"funder_award_id":"1016204","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8271635057","display_name":null,"funder_award_id":"1522654","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320332467","display_name":"U.S. Air Force","ror":"https://ror.org/006gmme17"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1494838936","https://openalex.org/W1534416612","https://openalex.org/W1539280904","https://openalex.org/W1603646489","https://openalex.org/W1975017829","https://openalex.org/W1977135073","https://openalex.org/W1982355466","https://openalex.org/W1986931325","https://openalex.org/W1988425770","https://openalex.org/W1988849934","https://openalex.org/W1999627297","https://openalex.org/W2000985550","https://openalex.org/W2002257715","https://openalex.org/W2012960907","https://openalex.org/W2017466123","https://openalex.org/W2018984203","https://openalex.org/W2026079992","https://openalex.org/W2033624514","https://openalex.org/W2036438040","https://openalex.org/W2038469228","https://openalex.org/W2039050532","https://openalex.org/W2042170876","https://openalex.org/W2043430160","https://openalex.org/W2043868859","https://openalex.org/W2044559999","https://openalex.org/W2049069909","https://openalex.org/W2050448951","https://openalex.org/W2069245506","https://openalex.org/W2070584352","https://openalex.org/W2076605490","https://openalex.org/W2089024363","https://openalex.org/W2090084467","https://openalex.org/W2092285919","https://openalex.org/W2093417350","https://openalex.org/W2100556411","https://openalex.org/W2104417092","https://openalex.org/W2116775748","https://openalex.org/W2117669906","https://openalex.org/W2123871098","https://openalex.org/W2126607811","https://openalex.org/W2142224912","https://openalex.org/W2149454052","https://openalex.org/W2151898625","https://openalex.org/W2153745131","https://openalex.org/W2169988972","https://openalex.org/W2334285086","https://openalex.org/W2373537127","https://openalex.org/W3029645440"],"related_works":["https://openalex.org/W2965106131","https://openalex.org/W2114808974","https://openalex.org/W2094757704","https://openalex.org/W25030584","https://openalex.org/W2065436195","https://openalex.org/W2610104823","https://openalex.org/W1970997620","https://openalex.org/W2092044038","https://openalex.org/W29231041","https://openalex.org/W2144582354"],"abstract_inverted_index":{"An":[0,108],"algorithm":[1,12,63,120,131],"is":[2,48,65,77,101,111,125,132,151,186],"developed":[3,112],"for":[4,79,113,168],"projecting":[5],"a":[6,9,14,69,104],"point":[7,156],"onto":[8],"polyhedron.":[10],"The":[11,35],"solves":[13],"dual":[15,30,60,90],"version":[16],"of":[17,88,181,193],"the":[18,24,27,33,38,56,59,85,89,92,129,140,144,154,160,173,182,191,194],"projection":[19,93,196],"problem":[20],"and":[21,29,58,95,171],"then":[22],"uses":[23],"relationship":[25],"between":[26],"primal":[28],"to":[31,50,67,91,103,153,172,188],"recover":[32],"projection.":[34],"techniques":[36],"in":[37,55,159],"paper":[39],"exploit":[40],"sparsity.":[41],"Sparse":[42],"reconstruction":[43],"by":[44],"separable":[45],"approximation":[46],"(SpaRSA)":[47],"used":[49,66],"approximately":[51],"identify":[52],"active":[53,61],"constraints":[54],"polyhedron,":[57],"set":[62],"(DASA)":[64],"compute":[68],"high":[70],"precision":[71],"solution.":[72],"A":[73,149],"linear":[74],"convergence":[75,99,106],"result":[76],"established":[78],"SpaRSA":[80,115],"that":[81,127,185],"does":[82],"not":[83],"require":[84],"strong":[86],"concavity":[87],"problem,":[94],"an":[96,117,179],"earlier":[97],"R-linear":[98],"rate":[100],"strengthened":[102],"Q-linear":[105],"property.":[107],"algorithmic":[109],"framework":[110],"combining":[114],"with":[116,143,190],"asymptotically":[118],"preferred":[119,130],"such":[121],"as":[122],"DASA.":[123],"It":[124],"shown":[126],"only":[128],"executed":[133],"asymptotically.":[134],"Numerical":[135],"results":[136],"are":[137],"given":[138],"using":[139],"polyhedra":[141],"associated":[142],"Netlib":[145],"LP":[146],"test":[147],"set.":[148],"comparison":[150],"made":[152],"interior":[155],"method":[157,184],"contained":[158],"general":[161],"purpose":[162],"open":[163],"source":[164],"software":[165],"package":[166,175],"IPOPT":[167],"nonlinear":[169],"optimization,":[170],"commercial":[174],"CPLEX,":[176],"which":[177],"contains":[178],"implementation":[180],"barrier":[183],"targeted":[187],"problems":[189],"structure":[192],"polyhedral":[195],"problem.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}