{"id":"https://openalex.org/W2592062427","doi":"https://doi.org/10.1137/130950288","title":"Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds","display_name":"Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2592062427","doi":"https://doi.org/10.1137/130950288","mag":"2592062427"},"language":"en","primary_location":{"id":"doi:10.1137/130950288","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130950288","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ion Necoara","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028772568","display_name":"Dragos Clipici","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dragos Clipici","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019114471"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.2826,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.98737117,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"26","issue":"1","first_page":"197","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9993000030517578,"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.9724000096321106,"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/mathematics","display_name":"Mathematics","score":0.8729175329208374},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7906638383865356},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.714942991733551},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.7019345760345459},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.6374128460884094},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5155267715454102},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.497574120759964},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.49640852212905884},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.47237303853034973},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.4672664701938629},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4590979218482971},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3627300262451172},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.351801335811615},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.26050299406051636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07476338744163513}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8729175329208374},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7906638383865356},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.714942991733551},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.7019345760345459},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.6374128460884094},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5155267715454102},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.497574120759964},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.49640852212905884},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.47237303853034973},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.4672664701938629},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4590979218482971},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3627300262451172},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.351801335811615},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.26050299406051636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07476338744163513},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/130950288","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130950288","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G3181387642","display_name":null,"funder_award_id":"176/01.10.2015","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"}],"funders":[{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1973754217","https://openalex.org/W1999593606","https://openalex.org/W2002745466","https://openalex.org/W2023901033","https://openalex.org/W2027026120","https://openalex.org/W2030161963","https://openalex.org/W2033121805","https://openalex.org/W2039050532","https://openalex.org/W2045185094","https://openalex.org/W2053764342","https://openalex.org/W2066179689","https://openalex.org/W2075660001","https://openalex.org/W2084453552","https://openalex.org/W2093417350","https://openalex.org/W2095984592","https://openalex.org/W2117686388","https://openalex.org/W2167820643","https://openalex.org/W2534284975"],"related_works":["https://openalex.org/W4221144530","https://openalex.org/W2807215287","https://openalex.org/W2291950750","https://openalex.org/W2953182765","https://openalex.org/W2560624268","https://openalex.org/W2964336028","https://openalex.org/W2905311796","https://openalex.org/W2592062427","https://openalex.org/W2950069819","https://openalex.org/W2079482358"],"abstract_inverted_index":{"In":[0],"this":[1,46],"paper":[2],"we":[3],"employ":[4],"a":[5,9,20,27,49,113],"parallel":[6],"version":[7],"of":[8,19,36,39,42,56,66,77,108,116,118,122],"randomized":[10],"(block)":[11],"coordinate":[12],"descent":[13],"method":[14,47,58],"for":[15,61],"minimizing":[16],"the":[17,34,40,43,57,62,74,97,101,106,119,123],"sum":[18],"partially":[21],"separable":[22,29],"smooth":[23,44,89,120],"convex":[24,31,91],"function":[25],"and":[26,88,112],"fully":[28],"nonsmooth":[30],"function.":[32,125],"Under":[33],"assumption":[35],"Lipschitz":[37],"continuity":[38],"gradient":[41],"function,":[45],"has":[48],"sublinear":[50],"convergence":[51,54,102],"rate.":[52],"Linear":[53],"rate":[55,103],"is":[59],"obtained":[60],"newly":[63],"introduced":[64],"class":[65,76],"generalized":[67,78],"error":[68,79,85],"bound":[69,80,86],"functions.":[70,92],"We":[71,93],"prove":[72],"that":[73,96],"new":[75],"functions":[81,87],"encompasses":[82],"both":[83],"global/local":[84],"strongly":[90],"also":[94],"show":[95],"theoretical":[98],"estimates":[99],"on":[100,105],"depend":[104],"number":[107],"blocks":[109],"chosen":[110],"randomly":[111],"natural":[114],"measure":[115],"separability":[117],"component":[121],"objective":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}