{"id":"https://openalex.org/W2788408502","doi":"https://doi.org/10.23919/eusipco.2018.8553274","title":"Parallel and Hybrid Soft-Thresholding Algorithms with Line Search for Sparse Nonlinear Regression","display_name":"Parallel and Hybrid Soft-Thresholding Algorithms with Line Search for Sparse Nonlinear Regression","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2788408502","doi":"https://doi.org/10.23919/eusipco.2018.8553274","mag":"2788408502"},"language":"en","primary_location":{"id":"doi:10.23919/eusipco.2018.8553274","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco.2018.8553274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 26th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbilu.uni.lu/handle/10993/35047","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100733872","display_name":"Yang Yang","orcid":"https://orcid.org/0000-0003-2817-3686"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":true,"raw_author_name":"Yang Yang","raw_affiliation_strings":["Reliability and Trust, University of Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Reliability and Trust, University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001481378","display_name":"Marius Pesavento","orcid":"https://orcid.org/0000-0003-3395-2588"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marius Pesavento","raw_affiliation_strings":["Communication Systems Group, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Communication Systems Group, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016154330","display_name":"Symeon Chatzinotas","orcid":"https://orcid.org/0000-0001-5122-0001"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Symeon Chatzinotas","raw_affiliation_strings":["Reliability and Trust, University of Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Reliability and Trust, University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080037825","display_name":"Bj\u00f6rn Ottersten","orcid":"https://orcid.org/0000-0003-2298-6774"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Bjorn Ottersten","raw_affiliation_strings":["Reliability and Trust, University of Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Reliability and Trust, University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100733872"],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.2081,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48007063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1587","last_page":"1591"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9969000220298767,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/algorithm","display_name":"Algorithm","score":0.6483721733093262},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5734138488769531},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5522739887237549},{"id":"https://openalex.org/keywords/thresholding","display_name":"Thresholding","score":0.5359979271888733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48369747400283813},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4559292793273926},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.4498358368873596},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.43547922372817993},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4105806350708008},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40339791774749756},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.384888231754303},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16732841730117798}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6483721733093262},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5734138488769531},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5522739887237549},{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.5359979271888733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48369747400283813},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4559292793273926},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.4498358368873596},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.43547922372817993},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4105806350708008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40339791774749756},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.384888231754303},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16732841730117798},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23919/eusipco.2018.8553274","is_oa":false,"landing_page_url":"https://doi.org/10.23919/eusipco.2018.8553274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 26th European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/35047","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/35047","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"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":"Proc. 26th European Signal Processing Conference (2018-09); 2018 26th European Signal Processing Conference (EUSIPCO), 03-09-2018 to 07-09-2018","raw_type":"peer reviewed"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:118856","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/118856/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Konferenzver\u00f6ffentlichung"}],"best_oa_location":{"id":"pmh:oai:orbilu.uni.lu:10993/35047","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/35047","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"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":"Proc. 26th European Signal Processing Conference (2018-09); 2018 26th European Signal Processing Conference (EUSIPCO), 03-09-2018 to 07-09-2018","raw_type":"peer reviewed"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1539331983","https://openalex.org/W1540764732","https://openalex.org/W2050968963","https://openalex.org/W2051245758","https://openalex.org/W2058361915","https://openalex.org/W2118607205","https://openalex.org/W2206289079","https://openalex.org/W2338807306","https://openalex.org/W2798766386","https://openalex.org/W2962765074","https://openalex.org/W4254313632","https://openalex.org/W6678073474","https://openalex.org/W6688433028"],"related_works":["https://openalex.org/W2953058328","https://openalex.org/W4285277090","https://openalex.org/W1542224353","https://openalex.org/W1661087619","https://openalex.org/W2378211422","https://openalex.org/W4327738859","https://openalex.org/W2750730210","https://openalex.org/W2116854923","https://openalex.org/W2236974868","https://openalex.org/W4312766348"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,115],"propose":[4,116],"a":[5,22,56,72,97,117],"convergent":[6],"iterative":[7,33],"algorithm":[8,18,35,44,106,154],"for":[9,45],"nondifferentiable":[10],"nonconvex":[11],"nonlinear":[12],"regression":[13],"problems.":[14],"The":[15],"proposed":[16,64,152,170],"parallel":[17,105],"consists":[19],"in":[20,59],"optimizing":[21],"sequence":[23],"of":[24,76,126,147],"successively":[25],"refined":[26],"approximate":[27,65],"functions.":[28],"Compared":[29],"with":[30],"the":[31,42,60,63,77,81,88,104,123,135,141,145,151,169],"popular":[32],"soft-thresholding":[34],"commonly":[36],"known":[37],"as":[38],"ISTA,":[39],"which":[40,53,92,130],"is":[41,93,137],"benchmark":[43],"such":[46],"problems,":[47],"it":[48],"has":[49],"two":[50],"attractive":[51],"features":[52],"lead":[54],"to":[55,70,112],"notable":[57],"reduction":[58],"algorithm's":[61],"complexity:":[62],"function":[66],"does":[67],"not":[68],"have":[69],"be":[71,84,108],"global":[73],"upper":[74],"bound":[75],"original":[78],"function,":[79],"and":[80],"stepsize":[82,136],"can":[83],"efficiently":[85],"computed":[86],"by":[87,139],"line":[89,142],"search":[90,143],"scheme":[91,120],"carried":[94],"out":[95],"over":[96],"properly":[98],"constructed":[99],"differentiable":[100],"function.":[101],"Furthermore,":[102],"when":[103],"cannot":[107],"fully":[109],"parallelized":[110],"due":[111],"memory/processor":[113],"constraints,":[114],"hybrid":[118,153,159],"updating":[119],"that":[121],"divides":[122],"whole":[124],"set":[125],"variables":[127],"into":[128],"blocks":[129],"are":[131,172],"updated":[132],"sequentially.":[133],"Since":[134],"obtained":[138],"performing":[140],"along":[144],"coordinate":[146],"each":[148],"block":[149],"variable,":[150],"converges":[155],"faster":[156],"than":[157],"state-of-the-art":[158],"algorithms":[160,171],"based":[161],"on":[162],"constant":[163],"stepsizes":[164],"and/or":[165],"decreasing":[166],"stepsizes.":[167],"Finally,":[168],"numerically":[173],"tested.":[174]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}