{"id":"https://openalex.org/W2962765074","doi":"https://doi.org/10.1109/icassp.2018.8461349","title":"A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization","display_name":"A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2962765074","doi":"https://doi.org/10.1109/icassp.2018.8461349","mag":"2962765074"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2018.8461349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2018.8461349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/1711.04489","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":["Interdisciplinary Centre for Security Reliability and Trust, University of Luxembourg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Interdisciplinary Centre for Security Reliability and Trust, University of Luxembourg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"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, 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"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100733872"],"corresponding_institution_ids":["https://openalex.org/I186903577"],"apc_list":null,"apc_paid":null,"fwci":0.6244,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68080299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"6323","last_page":"6327"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9915000200271606,"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/T11205","display_name":"Numerical methods in inverse problems","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/subgradient-method","display_name":"Subgradient method","score":0.8642768859863281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6831579804420471},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.6749302744865417},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5950102806091309},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5832895636558533},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.5419055819511414},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5124385952949524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5010240077972412},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.47223469614982605},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.44640469551086426},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42603451013565063},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4213741719722748},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4201241731643677},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.41275230050086975},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4014650583267212},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.09462961554527283},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07566994428634644}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8642768859863281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6831579804420471},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6749302744865417},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5950102806091309},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5832895636558533},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.5419055819511414},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5124385952949524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5010240077972412},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.47223469614982605},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.44640469551086426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42603451013565063},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4213741719722748},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4201241731643677},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.41275230050086975},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4014650583267212},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.09462961554527283},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07566994428634644},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icassp.2018.8461349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2018.8461349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/33772","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1711.04489","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. 2018 IEEE International Conference on Acoustics, Speech and Signal (2018-04); 2018 IEEE International Conference on Acoustics, Speech and Signal (ICASSP), from 15-04-2018 to 20-04-2018","raw_type":"peer reviewed"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:94556","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8461349","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/33772","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1711.04489","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. 2018 IEEE International Conference on Acoustics, Speech and Signal (2018-04); 2018 IEEE International Conference on Acoustics, Speech and Signal (ICASSP), from 15-04-2018 to 20-04-2018","raw_type":"peer reviewed"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1974661392","https://openalex.org/W2051245758","https://openalex.org/W2058361915","https://openalex.org/W2118550318","https://openalex.org/W2140738143","https://openalex.org/W2148556090","https://openalex.org/W2150226602","https://openalex.org/W2168955340","https://openalex.org/W2295652899","https://openalex.org/W2338807306","https://openalex.org/W2364382337","https://openalex.org/W2977966598","https://openalex.org/W3122732016"],"related_works":["https://openalex.org/W4392366352","https://openalex.org/W4224229293","https://openalex.org/W4310488135","https://openalex.org/W4364382936","https://openalex.org/W2363406025","https://openalex.org/W4225353730","https://openalex.org/W4297153560","https://openalex.org/W2465405765","https://openalex.org/W2964186284","https://openalex.org/W2804400349"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,29,47,85],"convergent":[6],"parallel":[7],"best-response":[8],"algorithm":[9,69,99],"with":[10],"the":[11,16,24,41,61,67,77,97],"exact":[12,62],"line":[13,63],"search":[14,64],"for":[15,57],"nondifferentiable":[17],"nonconvex":[18],"sparsity-regularized":[19],"rank":[20],"minimization":[21],"problem.":[22],"On":[23,40],"one":[25],"hand,":[26,43],"it":[27],"exhibits":[28],"faster":[30],"convergence":[31,45],"than":[32],"subgradient":[33,89],"algorithms":[34,54,90],"and":[35,91],"block":[36],"coordinate":[37],"descent":[38],"algorithms.":[39,95],"other":[42],"its":[44],"to":[46,75],"stationary":[48],"point":[49],"is":[50,70,83,100],"guaranteed,":[51],"while":[52],"ADMM":[53],"only":[55],"converge":[56],"convex":[58,93],"problems.":[59],"Furthermore,":[60],"procedure":[65],"in":[66,73,88],"proposed":[68,98],"performed":[71],"efficiently":[72],"closed-form":[74],"avoid":[76],"meticulous":[78],"choice":[79],"of":[80],"stepsizes,":[81],"which":[82],"however":[84],"common":[86],"bottleneck":[87],"successive":[92],"approximation":[94],"Finally,":[96],"numerically":[101],"tested.":[102]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}