{"id":"https://openalex.org/W2998383793","doi":"https://doi.org/10.1137/18m1219187","title":"Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems","display_name":"Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2998383793","doi":"https://doi.org/10.1137/18m1219187","mag":"2998383793"},"language":"en","primary_location":{"id":"doi:10.1137/18m1219187","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1219187","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":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/5b4e74be-60da-47cc-9dd3-76424889d3ee","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057733991","display_name":"Yun-Bin Zhao","orcid":"https://orcid.org/0000-0002-2388-9047"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Yun-Bin Zhao","raw_affiliation_strings":["School of Mathematics, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057733991"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":4.037,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.95191674,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"30","issue":"1","first_page":"31","last_page":"55"},"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.9998999834060669,"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.9998999834060669,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.994700014591217,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/thresholding","display_name":"Thresholding","score":0.952417254447937},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.6134054660797119},{"id":"https://openalex.org/keywords/balanced-histogram-thresholding","display_name":"Balanced histogram thresholding","score":0.583681046962738},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5465107560157776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5437406897544861},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5022575855255127},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4905504584312439},{"id":"https://openalex.org/keywords/restricted-isometry-property","display_name":"Restricted isometry property","score":0.46547171473503113},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45208799839019775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43233510851860046},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.39361467957496643},{"id":"https://openalex.org/keywords/image-processing","display_name":"Image processing","score":0.12758508324623108},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.11903160810470581},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.1022847592830658}],"concepts":[{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.952417254447937},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.6134054660797119},{"id":"https://openalex.org/C202577368","wikidata":"https://www.wikidata.org/wiki/Q2576067","display_name":"Balanced histogram thresholding","level":5,"score":0.583681046962738},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5465107560157776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5437406897544861},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5022575855255127},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4905504584312439},{"id":"https://openalex.org/C17902559","wikidata":"https://www.wikidata.org/wiki/Q17099734","display_name":"Restricted isometry property","level":3,"score":0.46547171473503113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45208799839019775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43233510851860046},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39361467957496643},{"id":"https://openalex.org/C9417928","wikidata":"https://www.wikidata.org/wiki/Q1070689","display_name":"Image processing","level":3,"score":0.12758508324623108},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.11903160810470581},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.1022847592830658},{"id":"https://openalex.org/C136943445","wikidata":"https://www.wikidata.org/wiki/Q1970240","display_name":"Histogram equalization","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/18m1219187","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1219187","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:pure.atira.dk:openaire_cris_publications/5b4e74be-60da-47cc-9dd3-76424889d3ee","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/5b4e74be-60da-47cc-9dd3-76424889d3ee","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Zhao, Y-B 2020, 'Optimal k-thresholding algorithms for sparse optimization problems', SIAM Journal on Optimization, vol. 30, no. 1, 25, pp. 31-55. https://doi.org/10.1137/18M1219187","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/5b4e74be-60da-47cc-9dd3-76424889d3ee","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/5b4e74be-60da-47cc-9dd3-76424889d3ee","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"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":"Zhao, Y-B 2020, 'Optimal k-thresholding algorithms for sparse optimization problems', SIAM Journal on Optimization, vol. 30, no. 1, 25, pp. 31-55. https://doi.org/10.1137/18M1219187","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8333624292","display_name":null,"funder_award_id":"EP/K00946X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W653768339","https://openalex.org/W1973376681","https://openalex.org/W1976709621","https://openalex.org/W1977520307","https://openalex.org/W1980454827","https://openalex.org/W1981487911","https://openalex.org/W1986931325","https://openalex.org/W1989009613","https://openalex.org/W2005836623","https://openalex.org/W2008350622","https://openalex.org/W2012961725","https://openalex.org/W2015418199","https://openalex.org/W2023101933","https://openalex.org/W2025079166","https://openalex.org/W2028781966","https://openalex.org/W2034268645","https://openalex.org/W2038517753","https://openalex.org/W2079756223","https://openalex.org/W2083346837","https://openalex.org/W2100556411","https://openalex.org/W2107861471","https://openalex.org/W2110505738","https://openalex.org/W2115706991","https://openalex.org/W2123023890","https://openalex.org/W2127271355","https://openalex.org/W2129131372","https://openalex.org/W2146842127","https://openalex.org/W2148556090","https://openalex.org/W2151693816","https://openalex.org/W2158940042","https://openalex.org/W2160979406","https://openalex.org/W2289917018","https://openalex.org/W2296052754","https://openalex.org/W2526012566","https://openalex.org/W2889336547","https://openalex.org/W2963322354","https://openalex.org/W2963351303"],"related_works":["https://openalex.org/W2750730210","https://openalex.org/W3103243916","https://openalex.org/W2295077625","https://openalex.org/W4299814392","https://openalex.org/W2757003988","https://openalex.org/W2900829073","https://openalex.org/W2353716847","https://openalex.org/W2151415411","https://openalex.org/W3049769024","https://openalex.org/W2075538113"],"abstract_inverted_index":{"The":[0,67,90,147],"simulations":[1],"indicate":[2],"that":[3,131,151],"the":[4,11,23,29,33,85,100,104,108,120,125,132,141,157,167,174],"existing":[5],"hard":[6,30,159],"thresholding":[7,31,35,58,81,122,134,160],"technique":[8,82],"independent":[9],"of":[10,22,28,69,87,110,143],"residual":[12,105],"function":[13],"may":[14],"cause":[15],"a":[16,55,61,79,115],"dramatic":[17],"increase":[18],"or":[19],"numerical":[20,148],"oscillation":[21],"residual.":[24],"This":[25,112],"inherent":[26],"drawback":[27],"renders":[32],"traditional":[34,158],"algorithms":[36,136,169],"unstable":[37],"and":[38,53],"thus":[39],"generally":[40],"inefficient":[41],"for":[42,93,119],"solving":[43,153],"practical":[44],"sparse":[45,144,154],"optimization":[46,145,155],"problems.":[47,146],"How":[48],"to":[49,73,98,103,114,140],"overcome":[50],"this":[51,65,70,75,94],"weakness":[52],"develop":[54],"truly":[56],"efficient":[57,121],"method":[59,177],"is":[60,72,97],"fundamental":[62],"question":[63,76],"in":[64,178],"field.":[66],"aim":[68],"paper":[71],"address":[74],"by":[77,166],"proposing":[78],"new":[80,95],"based":[83,135],"on":[84],"notion":[86],"optimal":[88,133],"$k$-thresholding.":[89],"central":[91],"idea":[92],"development":[96],"connect":[99],"$k$-thresholding":[101],"directly":[102],"reduction":[106],"during":[107],"course":[109],"algorithms.":[111],"leads":[113],"natural":[116],"design":[117],"principle":[118],"methods.":[123],"Under":[124],"restricted":[126],"isometry":[127],"property,":[128],"we":[129],"prove":[130],"are":[137],"globally":[138],"convergent":[139],"solution":[142],"experiments":[149],"demonstrate":[150],"when":[152],"problems,":[156],"methods":[161],"have":[162],"been":[163],"significantly":[164],"transcended":[165],"proposed":[168],"which":[170],"can":[171],"even":[172],"outperform":[173],"classic":[175],"$\\ell_1$-minimization":[176],"many":[179],"situations.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":10},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}