{"id":"https://openalex.org/W2032693829","doi":"https://doi.org/10.1137/100785028","title":"Sparse Optimization with Least-Squares Constraints","display_name":"Sparse Optimization with Least-Squares Constraints","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2032693829","doi":"https://doi.org/10.1137/100785028","mag":"2032693829"},"language":"en","primary_location":{"id":"doi:10.1137/100785028","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100785028","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/A5091640094","display_name":"E. van den Berg","orcid":"https://orcid.org/0000-0002-0991-3397"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ewout van den Berg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054518852","display_name":"Michael P. Friedlander","orcid":"https://orcid.org/0000-0003-0222-5222"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael P. Friedlander","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.037,"has_fulltext":false,"cited_by_count":232,"citation_normalized_percentile":{"value":0.99203166,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"21","issue":"4","first_page":"1201","last_page":"1229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9998000264167786,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9987999796867371,"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/compressed-sensing","display_name":"Compressed sensing","score":0.728399395942688},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5710804462432861},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5709818601608276},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.5576373338699341},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5545536279678345},{"id":"https://openalex.org/keywords/basis-pursuit","display_name":"Basis pursuit","score":0.5424559712409973},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5228115320205688},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.471365362405777},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.46723777055740356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43593788146972656},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.41671666502952576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37504392862319946},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22541412711143494},{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.16040390729904175}],"concepts":[{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.728399395942688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5710804462432861},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5709818601608276},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.5576373338699341},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5545536279678345},{"id":"https://openalex.org/C99217422","wikidata":"https://www.wikidata.org/wiki/Q4867576","display_name":"Basis pursuit","level":4,"score":0.5424559712409973},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5228115320205688},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.471365362405777},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.46723777055740356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43593788146972656},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.41671666502952576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37504392862319946},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22541412711143494},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.16040390729904175},{"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/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100785028","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100785028","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W8251247","https://openalex.org/W84046028","https://openalex.org/W633277346","https://openalex.org/W1485685653","https://openalex.org/W1521080652","https://openalex.org/W1583497301","https://openalex.org/W1601774887","https://openalex.org/W1973734200","https://openalex.org/W1978259121","https://openalex.org/W1986931325","https://openalex.org/W2001841288","https://openalex.org/W2003753589","https://openalex.org/W2007437396","https://openalex.org/W2011359124","https://openalex.org/W2028781966","https://openalex.org/W2047071281","https://openalex.org/W2050834445","https://openalex.org/W2066459185","https://openalex.org/W2066881599","https://openalex.org/W2074054045","https://openalex.org/W2083042020","https://openalex.org/W2089859153","https://openalex.org/W2098996169","https://openalex.org/W2100556411","https://openalex.org/W2101675075","https://openalex.org/W2103519107","https://openalex.org/W2103972604","https://openalex.org/W2107501462","https://openalex.org/W2107861471","https://openalex.org/W2109449402","https://openalex.org/W2114147096","https://openalex.org/W2118163005","https://openalex.org/W2118550318","https://openalex.org/W2126607811","https://openalex.org/W2131593837","https://openalex.org/W2134332047","https://openalex.org/W2135046866","https://openalex.org/W2145962650","https://openalex.org/W2147276092","https://openalex.org/W2152374199","https://openalex.org/W2152927766","https://openalex.org/W2157184353","https://openalex.org/W2163916252","https://openalex.org/W2164452299","https://openalex.org/W2167732364","https://openalex.org/W2170860899","https://openalex.org/W2170929819","https://openalex.org/W2296616510","https://openalex.org/W2337036514","https://openalex.org/W2339666411","https://openalex.org/W2611328865","https://openalex.org/W2949351217","https://openalex.org/W3022380717","https://openalex.org/W3098270385","https://openalex.org/W3104624268","https://openalex.org/W4250955649","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2984862312","https://openalex.org/W3005946484","https://openalex.org/W2330143608","https://openalex.org/W2937169764","https://openalex.org/W2601733327","https://openalex.org/W2545658981","https://openalex.org/W2946877649","https://openalex.org/W2041507040","https://openalex.org/W2032693829","https://openalex.org/W3037851568"],"abstract_inverted_index":{"The":[0],"use":[1],"of":[2,8,24,39,42,57,64],"convex":[3],"optimization":[4],"for":[5,52],"the":[6,22,76],"recovery":[7],"sparse":[9,29],"signals":[10],"from":[11],"incomplete":[12],"or":[13],"compressed":[14],"data":[15],"is":[16],"now":[17],"common":[18,62],"practice.":[19],"Motivated":[20],"by":[21],"success":[23],"basis":[25],"pursuit":[26],"in":[27],"recovering":[28],"vectors,":[30],"new":[31],"formulations":[32],"have":[33],"been":[34],"proposed":[35],"that":[36],"take":[37],"advantage":[38],"different":[40],"types":[41,63],"sparsity.":[43],"In":[44],"this":[45],"paper":[46],"we":[47,66],"propose":[48],"an":[49],"efficient":[50],"algorithm":[51],"solving":[53],"a":[54],"general":[55],"class":[56],"sparsifying":[58],"formulations.":[59],"For":[60],"several":[61],"sparsity":[65],"provide":[67],"applications,":[68],"along":[69],"with":[70],"details":[71],"on":[72],"how":[73],"to":[74],"apply":[75],"algorithm,":[77],"and":[78],"experimental":[79],"results.":[80]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":28},{"year":2017,"cited_by_count":25},{"year":2016,"cited_by_count":25},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-20T22:02:38.213706","created_date":"2025-10-10T00:00:00"}