{"id":"https://openalex.org/W2048302985","doi":"https://doi.org/10.1109/cdc.2012.6426370","title":"A random coordinate descent method for large-scale resource allocation problems","display_name":"A random coordinate descent method for large-scale resource allocation problems","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2048302985","doi":"https://doi.org/10.1109/cdc.2012.6426370","mag":"2048302985"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2012.6426370","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st 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"]},{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"I. Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, Polytechnic University of Bucharest, Bucharest, Romania","University Politehnica Bucharest, Automatic Control and Systems Engineering Department, 060042, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, Polytechnic University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442","https://openalex.org/I61641377"]},{"raw_affiliation_string":"University Politehnica Bucharest, Automatic Control and Systems Engineering Department, 060042, 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/I141595442","https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.3429,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.61661792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"4474","last_page":"4479"},"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.9998000264167786,"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.9998000264167786,"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.9987999796867371,"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.9848999977111816,"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/coordinate-descent","display_name":"Coordinate descent","score":0.7140942215919495},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6461417078971863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.54494708776474},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5407604575157166},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.5375731587409973},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5294430255889893},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4652809500694275},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.44520682096481323},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4431866705417633},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.44257980585098267},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.433157742023468},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4144875109195709},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37926679849624634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37599462270736694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3715053200721741},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14901074767112732},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.08798286318778992}],"concepts":[{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.7140942215919495},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6461417078971863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54494708776474},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5407604575157166},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.5375731587409973},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5294430255889893},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4652809500694275},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.44520682096481323},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4431866705417633},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.44257980585098267},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.433157742023468},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4144875109195709},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37926679849624634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37599462270736694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3715053200721741},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14901074767112732},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.08798286318778992},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","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/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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2012.6426370","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6426370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st 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":20,"referenced_works":["https://openalex.org/W1525912103","https://openalex.org/W1982941867","https://openalex.org/W2002482313","https://openalex.org/W2039050532","https://openalex.org/W2067484689","https://openalex.org/W2114085163","https://openalex.org/W2116940697","https://openalex.org/W2117686388","https://openalex.org/W2124541940","https://openalex.org/W2165966284","https://openalex.org/W2726938673","https://openalex.org/W2752061190","https://openalex.org/W2787198218","https://openalex.org/W3123423968","https://openalex.org/W4242209908","https://openalex.org/W4255680218","https://openalex.org/W6631422176","https://openalex.org/W6674294995","https://openalex.org/W6677714106","https://openalex.org/W6740552509"],"related_works":["https://openalex.org/W2486267010","https://openalex.org/W4298096494","https://openalex.org/W1678820847","https://openalex.org/W2117229703","https://openalex.org/W2559216629","https://openalex.org/W1553684505","https://openalex.org/W1607707911","https://openalex.org/W2037211941","https://openalex.org/W2484651380","https://openalex.org/W2140057251"],"abstract_inverted_index":{"In":[0],"this":[1,106],"paper":[2],"we":[3,116,124],"develop":[4],"a":[5,58,88,120],"randomized":[6,107],"(block)":[7],"coordinate":[8],"descent":[9],"method":[10,82,89,131],"for":[11,21,31,129],"solving":[12,119],"singly":[13],"linear":[14,42],"equality":[15],"constrained":[16],"optimization":[17],"problems":[18],"that":[19,30,45,61,132],"appear":[20],"example":[22],"in":[23,64],"resource":[24],"allocation":[25],"over":[26],"networks.":[27],"We":[28,95],"show":[29,133],"strongly":[32],"convex":[33],"objective":[34],"functions":[35],"the":[36,48,67,70,75,102],"new":[37],"algorithm":[38,108],"has":[39],"an":[40],"expected":[41],"convergence":[43],"rate":[44],"depends":[46],"on":[47,91,98,136],"second":[49],"smallest":[50],"eigenvalue":[51],"\u03bb":[52],"<sub":[53],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[54],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[55],"(Q)":[56],"of":[57,66,72,80,87],"matrix":[59],"Q":[60],"is":[62,83],"defined":[63],"terms":[65],"probabilities":[68,103],"and":[69,115],"number":[71],"blocks.":[73],"However,":[74],"computational":[76],"complexity":[77],"per":[78],"iteration":[79],"our":[81,130],"much":[84],"simpler":[85],"than":[86],"based":[90],"full":[92],"gradient":[93],"information.":[94],"also":[96],"focus":[97],"how":[99],"to":[100,104,109],"choose":[101],"make":[105],"converge":[110],"as":[111,113],"fast":[112],"possible":[114],"arrive":[117],"at":[118],"sparse":[121,138],"SDP.":[122],"Finally,":[123],"present":[125],"some":[126],"numerical":[127],"results":[128],"its":[134],"efficiency":[135],"huge":[137],"problems.":[139]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}