{"id":"https://openalex.org/W2291892967","doi":"https://doi.org/10.1109/cdc.2015.7402237","title":"Distributed and parallel random coordinate descent methods for huge convex programming over networks","display_name":"Distributed and parallel random coordinate descent methods for huge convex programming over networks","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2291892967","doi":"https://doi.org/10.1109/cdc.2015.7402237","mag":"2291892967"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2015.7402237","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2015.7402237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 54th IEEE Conference on Decision and Control (CDC)","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/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019114471"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.13527365,"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":null,"last_page":null},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9987000226974487,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.7549317479133606},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.7176998257637024},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.5496464967727661},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5175370573997498},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4814312160015106},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44538936018943787},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43490657210350037},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36021119356155396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3319736421108246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26508212089538574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1702173948287964}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7549317479133606},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.7176998257637024},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.5496464967727661},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5175370573997498},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4814312160015106},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44538936018943787},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43490657210350037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36021119356155396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3319736421108246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26508212089538574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1702173948287964},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2015.7402237","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2015.7402237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 54th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1710475132","https://openalex.org/W1999593606","https://openalex.org/W2002745466","https://openalex.org/W2023901033","https://openalex.org/W2026463410","https://openalex.org/W2032395696","https://openalex.org/W2033511209","https://openalex.org/W2060777387","https://openalex.org/W2072265605","https://openalex.org/W2084453552","https://openalex.org/W2095984592","https://openalex.org/W2114085163","https://openalex.org/W2117575248","https://openalex.org/W2124541940","https://openalex.org/W2963183767","https://openalex.org/W3103669764","https://openalex.org/W3141595720","https://openalex.org/W4301152293","https://openalex.org/W6658528111"],"related_works":["https://openalex.org/W2486267010","https://openalex.org/W1678820847","https://openalex.org/W2117229703","https://openalex.org/W2559216629","https://openalex.org/W4298096494","https://openalex.org/W1553684505","https://openalex.org/W2037211941","https://openalex.org/W2484651380","https://openalex.org/W3153752017","https://openalex.org/W4384575246"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,22,29,86,133],"develop":[4],"parallel":[5,38,54,137],"random":[6],"coordinate":[7,138],"gradient":[8,67],"descent":[9,139],"methods":[10,85],"for":[11,51,83],"minimizing":[12],"huge":[13],"linearly":[14,106],"constrained":[15],"separable":[16],"convex":[17,129],"problems":[18],"over":[19,97],"networks.":[20],"Since":[21],"have":[23],"coupled":[24],"constraints":[25],"in":[26,37,75,88,93,123,126],"the":[27,47,65,70,76,102,108,128,136],"problem,":[28],"devise":[30],"a":[31],"family":[32],"of":[33,64,72,110],"algorithms":[34,48],"that":[35,82,121,135],"updates":[36],"\u03c4":[39,142,152],"\u2265":[40],"2":[41,144],"(block)":[42,111],"components":[43,112],"per":[44,59],"iteration.":[45],"Moreover,":[46],"are":[49],"adequate":[50],"distributed":[52],"and":[53,56,100],"computations":[55],"their":[57],"complexity":[58],"iteration":[60],"is":[61,78],"cheaper":[62],"than":[63],"full":[66],"method":[68,140],"when":[69],"number":[71,109],"nodes":[73],"N":[74],"network":[77],"huge.":[79],"We":[80,116],"prove":[81],"these":[84],"obtain":[87],"expectation":[89],"an":[90],"o-accurate":[91],"solution":[92],"at":[94],"most":[95],"O(N":[96],"\u03c4\u03b5)":[98],"iterations":[99],"thus":[101],"convergence":[103],"rate":[104],"depends":[105],"on":[107,146],"to":[113,151],"be":[114],"updated.":[115],"also":[117],"describe":[118],"several":[119],"applications":[120],"fit":[122],"our":[124],"framework,":[125],"particular":[127],"feasibility":[130],"problem.":[131],"Numerically,":[132],"show":[134],"with":[141],">":[143],"accelerates":[145],"its":[147],"basic":[148],"counterpart":[149],"corresponding":[150],"=":[153],"2.":[154]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}