{"id":"https://openalex.org/W2776188025","doi":"https://doi.org/10.1109/spawc.2017.8227767","title":"Essentially cyclic asynchronous nonconvex large-scale optimization","display_name":"Essentially cyclic asynchronous nonconvex large-scale optimization","publication_year":2017,"publication_date":"2017-07-01","ids":{"openalex":"https://openalex.org/W2776188025","doi":"https://doi.org/10.1109/spawc.2017.8227767","mag":"2776188025"},"language":"en","primary_location":{"id":"doi:10.1109/spawc.2017.8227767","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spawc.2017.8227767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008490187","display_name":"Loris Cannelli","orcid":"https://orcid.org/0000-0002-7161-6414"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"L. Cannelli","raw_affiliation_strings":["School of Industrial Engineering, Purdue University, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Purdue University, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019411025","display_name":"Francisco Facchinei","orcid":"https://orcid.org/0000-0002-7714-1210"},"institutions":[{"id":"https://openalex.org/I4210127672","display_name":"Engineering (Italy)","ror":"https://ror.org/045s9b323","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210127672"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Facchinei","raw_affiliation_strings":["Dept. of Computer Control, and Management Engineering, University of Rome, \u201cLa Sapienza\u201d, Italy","Dept. of Computer Control, and Management Engineering, University of Rome, \"La Sapienza\", Italy"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Control, and Management Engineering, University of Rome, \u201cLa Sapienza\u201d, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Dept. of Computer Control, and Management Engineering, University of Rome, \"La Sapienza\", Italy","institution_ids":["https://openalex.org/I861853513","https://openalex.org/I4210127672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066151990","display_name":"Vyacheslav Kungurtsev","orcid":"https://orcid.org/0000-0003-2229-8824"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"V. Kungurtsev","raw_affiliation_strings":["Agent Technology Center, Czech Technical University in Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Agent Technology Center, Czech Technical University in Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041765559","display_name":"Gesualdo Scutari","orcid":"https://orcid.org/0000-0002-6453-6870"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Scutari","raw_affiliation_strings":["School of Industrial Engineering, Purdue University, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Purdue University, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008490187"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19291463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":null,"first_page":"1","last_page":"5"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9979000091552734,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.840912401676178},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.8147335052490234},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.640680193901062},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5982294082641602},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.553989589214325},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5105205774307251},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.501370906829834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5005083084106445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4833357036113739},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46209990978240967},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4361902177333832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4262252748012543},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42145997285842896},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37123212218284607},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3663836121559143},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14950639009475708},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12716996669769287},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09362557530403137}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.840912401676178},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8147335052490234},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.640680193901062},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5982294082641602},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.553989589214325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5105205774307251},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.501370906829834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5005083084106445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4833357036113739},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46209990978240967},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4361902177333832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4262252748012543},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42145997285842896},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37123212218284607},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3663836121559143},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14950639009475708},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12716996669769287},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09362557530403137},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/spawc.2017.8227767","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spawc.2017.8227767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1100979","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org.ezproxy.uniroma1.it/stamp/stamp.jsp?tp=&arnumber=8227767","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W104095019","https://openalex.org/W604355987","https://openalex.org/W778657980","https://openalex.org/W1506295250","https://openalex.org/W1580723439","https://openalex.org/W1603765807","https://openalex.org/W2030161963","https://openalex.org/W2039050532","https://openalex.org/W2047894825","https://openalex.org/W2058361915","https://openalex.org/W2079482358","https://openalex.org/W2100007248","https://openalex.org/W2100556411","https://openalex.org/W2118607205","https://openalex.org/W2138243089","https://openalex.org/W2152637881","https://openalex.org/W2266148951","https://openalex.org/W2295566694","https://openalex.org/W2338429643","https://openalex.org/W2411494334","https://openalex.org/W2475736732","https://openalex.org/W2560549724","https://openalex.org/W2579962643","https://openalex.org/W2616811598","https://openalex.org/W2951781666","https://openalex.org/W2963903325","https://openalex.org/W2964006870","https://openalex.org/W2964120262","https://openalex.org/W3103793615","https://openalex.org/W6622473587","https://openalex.org/W6675069819","https://openalex.org/W6678073474","https://openalex.org/W6714710207","https://openalex.org/W6732954133","https://openalex.org/W6764309476"],"related_works":["https://openalex.org/W4246549241","https://openalex.org/W2168758875","https://openalex.org/W2410733619","https://openalex.org/W2963483475","https://openalex.org/W2945629716","https://openalex.org/W4283775266","https://openalex.org/W3043533097","https://openalex.org/W4298860769","https://openalex.org/W2767126220","https://openalex.org/W3007770227"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,16,21,36,46,99],"novel":[3],"parallel":[4],"essentially":[5],"cyclic":[6,73],"asynchronous":[7,43,132],"algorithm":[8,93],"for":[9],"the":[10,13,61,64,71,110],"minimization":[11],"of":[12,15,60,66,112],"sum":[14],"smooth":[17],"(nonconvex)":[18],"function":[19],"and":[20,34,49,103],"convex":[22],"(nonsmooth)":[23],"regularizer.":[24],"The":[25,92],"framework":[26],"hinges":[27],"on":[28,35],"Successive":[29],"Convex":[30],"Approximation":[31],"(SCA)":[32],"techniques":[33],"new":[37],"global":[38],"model":[39,62],"that":[40,125],"describes":[41],"many":[42],"environments":[44],"in":[45],"more":[47],"faithful":[48],"exhaustive":[50],"way":[51],"with":[52,107],"respect":[53,108],"to":[54,70,97,109,116,130],"state-of-the-art":[55],"models.":[56],"A":[57],"key":[58],"feature":[59],"is":[63,94,119],"update":[65],"(block)":[67,85],"variables":[68,86],"according":[69],"essential":[72],"rule:":[74],"an":[75],"integer":[76],"B":[77,82],"exists":[78],"such":[79],"that,":[80],"every":[81],"iterations,":[83],"all":[84],"are":[87],"updated":[88],"at":[89],"least":[90],"once.":[91],"theoretically":[95],"guaranteed":[96],"achieve":[98],"sublinear":[100],"convergence":[101,115],"rate":[102],"near":[104],"linear":[105],"speedup":[106],"number":[111],"cores.":[113],"Asymptotic":[114],"stationary":[117],"solutions":[118],"also":[120],"proved.":[121],"Numerical":[122],"results":[123],"show":[124],"our":[126],"scheme":[127],"compares":[128],"favorably":[129],"existing":[131],"methods.":[133]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}