{"id":"https://openalex.org/W3136445733","doi":"https://doi.org/10.1007/s10107-021-01633-2","title":"A unified approach for a 1D generalized total variation problem","display_name":"A unified approach for a 1D generalized total variation problem","publication_year":2021,"publication_date":"2021-03-13","ids":{"openalex":"https://openalex.org/W3136445733","doi":"https://doi.org/10.1007/s10107-021-01633-2","mag":"3136445733"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-021-01633-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01633-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01633-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01633-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007758023","display_name":"Cheng Lu","orcid":"https://orcid.org/0000-0001-5137-7199"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Cheng Lu","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0001-5137-7199","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0002-2498-0512","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007758023"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.7598,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.61922137,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"194","issue":"1-2","first_page":"415","last_page":"442"},"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/T12015","display_name":"Photoacoustic and Ultrasonic Imaging","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"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.998199999332428,"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/proximal-gradient-methods-for-learning","display_name":"Proximal gradient methods for learning","score":0.7862061858177185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7269532680511475},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.6954192519187927},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5786572098731995},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5757205486297607},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5623431205749512},{"id":"https://openalex.org/keywords/total-variation-denoising","display_name":"Total variation denoising","score":0.5563037395477295},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.5246622562408447},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5074114203453064},{"id":"https://openalex.org/keywords/fidelity","display_name":"Fidelity","score":0.5071241855621338},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4601363241672516},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.43583327531814575},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.40436482429504395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38399678468704224},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3675544857978821},{"id":"https://openalex.org/keywords/noise-reduction","display_name":"Noise reduction","score":0.28097808361053467},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21520495414733887},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11510160565376282},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.106050044298172}],"concepts":[{"id":"https://openalex.org/C79248915","wikidata":"https://www.wikidata.org/wiki/Q17086776","display_name":"Proximal gradient methods for learning","level":5,"score":0.7862061858177185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7269532680511475},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.6954192519187927},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5786572098731995},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5757205486297607},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5623431205749512},{"id":"https://openalex.org/C207282899","wikidata":"https://www.wikidata.org/wiki/Q7828156","display_name":"Total variation denoising","level":3,"score":0.5563037395477295},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.5246622562408447},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5074114203453064},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.5071241855621338},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4601363241672516},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.43583327531814575},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40436482429504395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38399678468704224},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3675544857978821},{"id":"https://openalex.org/C163294075","wikidata":"https://www.wikidata.org/wiki/Q581861","display_name":"Noise reduction","level":2,"score":0.28097808361053467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21520495414733887},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11510160565376282},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.106050044298172},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-021-01633-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01633-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01633-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10107-021-01633-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01633-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01633-2.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3810256257","display_name":null,"funder_award_id":"1760102","funder_id":"https://openalex.org/F4320337391","funder_display_name":"Division of Civil, Mechanical and Manufacturing Innovation"},{"id":"https://openalex.org/G4454131363","display_name":"A Graph Theoretic Approach for Spatial Dependence in Quality Control and Prediction","funder_award_id":"1760102","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8110737226","display_name":null,"funder_award_id":"CMMI-1760102","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/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3136445733.pdf","grobid_xml":"https://content.openalex.org/works/W3136445733.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1494141862","https://openalex.org/W1667912148","https://openalex.org/W1965755064","https://openalex.org/W1979585884","https://openalex.org/W2013347084","https://openalex.org/W2021345239","https://openalex.org/W2025289780","https://openalex.org/W2032008511","https://openalex.org/W2046033161","https://openalex.org/W2050023599","https://openalex.org/W2053352956","https://openalex.org/W2056515188","https://openalex.org/W2072081687","https://openalex.org/W2080238139","https://openalex.org/W2080375462","https://openalex.org/W2089700840","https://openalex.org/W2103559027","https://openalex.org/W2147155457","https://openalex.org/W2162894628","https://openalex.org/W2187697692","https://openalex.org/W2779591487","https://openalex.org/W2964284936","https://openalex.org/W3100717425","https://openalex.org/W3102748668","https://openalex.org/W4239030286"],"related_works":["https://openalex.org/W3208916810","https://openalex.org/W1995757014","https://openalex.org/W3009102021","https://openalex.org/W2388570749","https://openalex.org/W2130502871","https://openalex.org/W2370594013","https://openalex.org/W2793159183","https://openalex.org/W2570633406","https://openalex.org/W4239678022","https://openalex.org/W4323344618"],"abstract_inverted_index":{"Abstract":[0],"We":[1,41],"study":[2],"a":[3,13,44,74,88],"1-dimensional":[4],"discrete":[5],"signal":[6,31],"denoising":[7],"problem":[8,34,50,79],"that":[9,58],"consists":[10],"of":[11,15,29,121,132],"minimizing":[12],"sum":[14],"separable":[16],"convex":[17,21,53,82],"fidelity":[18,54,83,95],"terms":[19],"and":[20,55,84,87,99],"regularization":[22,39,56,85,101],"terms,":[23],"the":[24,27,36,49,62,78,94,100,109,119,133,145],"latter":[25],"penalize":[26],"differences":[28],"adjacent":[30],"values.":[32],"This":[33,66],"generalizes":[35],"total":[37],"variation":[38],"problem.":[40,146],"provide":[42],"here":[43,70],"unified":[45],"approach":[46,67],"to":[47,71,73],"solve":[48],"for":[51,77,118,144],"general":[52,81],"functions":[57,96,102,123],"is":[59,68,135],"based":[60],"on":[61],"Karush\u2013Kuhn\u2013Tucker":[63],"optimality":[64],"conditions.":[65],"shown":[69],"lead":[72],"fast":[75],"algorithm":[76,90],"with":[80],"functions,":[86],"faster":[89,137],"if,":[91],"in":[92,127],"addition,":[93],"are":[97,103],"differentiable":[98],"strictly":[104],"convex.":[105],"Both":[106],"algorithms":[107,117],"achieve":[108],"best":[110],"theoretical":[111],"worst":[112],"case":[113],"complexity":[114],"over":[115],"existing":[116],"classes":[120],"objective":[122],"studied":[124],"here.":[125],"Also":[126],"practice,":[128],"our":[129],"C++":[130,140],"implementation":[131],"method":[134],"considerably":[136],"than":[138],"popular":[139],"nonlinear":[141],"optimization":[142],"solvers":[143]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}