{"id":"https://openalex.org/W2210233862","doi":"https://doi.org/10.1109/eusipco.2015.7362679","title":"A novel line search method for nonsmooth optimization problems","display_name":"A novel line search method for nonsmooth optimization problems","publication_year":2015,"publication_date":"2015-08-01","ids":{"openalex":"https://openalex.org/W2210233862","doi":"https://doi.org/10.1109/eusipco.2015.7362679","mag":"2210233862"},"language":"en","primary_location":{"id":"doi:10.1109/eusipco.2015.7362679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eusipco.2015.7362679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 23rd 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/34171","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/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":true,"raw_author_name":"Yang Yang","raw_affiliation_strings":["Communication Systems Group, Darmstadt University of Technology, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Communication Systems Group, Darmstadt University of Technology, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","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, Darmstadt University of Technology, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Communication Systems Group, Darmstadt University of Technology, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100733872"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":0.6701,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71387243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1726","last_page":"1730"},"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.9994000196456909,"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.9994000196456909,"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.9991999864578247,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"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/line-search","display_name":"Line search","score":0.7548797130584717},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6634304523468018},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6499104499816895},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5302984714508057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5069289803504944},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.481160044670105},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44014281034469604},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41376951336860657},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41254886984825134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3981342613697052},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.1177019476890564}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.7548797130584717},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6634304523468018},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6499104499816895},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5302984714508057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5069289803504944},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.481160044670105},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44014281034469604},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41376951336860657},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41254886984825134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3981342613697052},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.1177019476890564},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/eusipco.2015.7362679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eusipco.2015.7362679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 23rd European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/34171","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/34171","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. 23rd European Signal Processing Conference (2015-08); 2015 23rd European Signal Processing Conference (EUSIPCO), from 31-08-2015 to 04-09-2015","raw_type":"peer reviewed"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:79930","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/79930/","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/34171","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/34171","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. 23rd European Signal Processing Conference (2015-08); 2015 23rd European Signal Processing Conference (EUSIPCO), from 31-08-2015 to 04-09-2015","raw_type":"peer reviewed"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1603765807","https://openalex.org/W1955471624","https://openalex.org/W2035815925","https://openalex.org/W2058361915","https://openalex.org/W2062770263","https://openalex.org/W2100556411","https://openalex.org/W2125113829","https://openalex.org/W2126607811","https://openalex.org/W2135046866","https://openalex.org/W2148556090","https://openalex.org/W2164278908","https://openalex.org/W2798766386","https://openalex.org/W4254313632","https://openalex.org/W4292363360"],"related_works":["https://openalex.org/W1546266651","https://openalex.org/W4289793162","https://openalex.org/W2108283631","https://openalex.org/W2107915509","https://openalex.org/W1967942590","https://openalex.org/W2538271650","https://openalex.org/W2035394906","https://openalex.org/W1986294906","https://openalex.org/W4376455749","https://openalex.org/W2167137033"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,30],"novel":[6],"exact/successive":[7],"line":[8,27,65],"search":[9,28,66],"method":[10],"for":[11,17],"stepsize":[12],"calculation":[13],"in":[14,82],"iterative":[15],"algorithms":[16],"nonsmooth":[18,39],"optimization":[19],"problems.":[20],"The":[21],"proposed":[22,63],"approach":[23],"is":[24,67,80,87],"to":[25,60,73,91],"perform":[26],"over":[29],"properly":[31],"constructed":[32],"differ-entiable":[33],"function":[34],"based":[35],"on":[36],"the":[37,48,62,92],"original":[38],"objective":[40],"function,":[41],"and":[42,55,86],"it":[43,79],"outperforms":[44],"state-of-the-art":[45],"techniques":[46],"from":[47],"perspective":[49],"of":[50,94],"convergence":[51],"speed,":[52],"computational":[53],"complexity":[54],"signaling":[56],"burden.":[57],"When":[58],"applied":[59],"LASSO,":[61],"exact":[64],"shown,":[68],"either":[69],"analytically":[70],"or":[71],"numerically,":[72],"exhibit":[74],"several":[75],"desirable":[76],"advantages,":[77],"namely:":[78],"implementable":[81],"closed-form,":[83],"converges":[84],"fast":[85],"robust":[88],"with":[89],"respect":[90],"choice":[93],"problem":[95],"parameters.":[96]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}