{"id":"https://openalex.org/W4385951689","doi":"https://doi.org/10.1137/22m148700x","title":"Random Coordinate Descent Methods for Nonseparable Composite Optimization","display_name":"Random Coordinate Descent Methods for Nonseparable Composite Optimization","publication_year":2023,"publication_date":"2023-08-17","ids":{"openalex":"https://openalex.org/W4385951689","doi":"https://doi.org/10.1137/22m148700x"},"language":"en","primary_location":{"id":"doi:10.1137/22m148700x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m148700x","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/A5079579696","display_name":"Fl\u00e1via Chorobura","orcid":null},"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":"Flavia Chorobura","raw_affiliation_strings":["Automatic Control and Systems Engineering, University Politehnica Bucharest, 060042 Bucharest, Romania","Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania,"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering, University Politehnica Bucharest, 060042 Bucharest, Romania","institution_ids":[]},{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania,","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering, University Politehnica Bucharest, 060042 Bucharest, Romania and Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering, University Politehnica Bucharest, 060042 Bucharest, Romania and Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079579696"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":1.0585,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.72005112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"33","issue":"3","first_page":"2160","last_page":"2190"},"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.9998999834060669,"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.9998999834060669,"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.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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9976999759674072,"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/coordinate-descent","display_name":"Coordinate descent","score":0.7977018356323242},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.7312005162239075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.718395471572876},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6381735801696777},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.6123178005218506},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5632219314575195},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5094068646430969},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.49077853560447693},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4386316239833832},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42737269401550293},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.415755033493042},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.38931435346603394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3235439360141754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2034851312637329},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10867121815681458},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.09014740586280823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0837278664112091},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06776854395866394}],"concepts":[{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.7977018356323242},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.7312005162239075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.718395471572876},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6381735801696777},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.6123178005218506},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5632219314575195},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5094068646430969},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.49077853560447693},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4386316239833832},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42737269401550293},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.415755033493042},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.38931435346603394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3235439360141754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2034851312637329},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10867121815681458},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.09014740586280823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0837278664112091},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06776854395866394},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/22m148700x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m148700x","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":[],"awards":[{"id":"https://openalex.org/G1436975304","display_name":null,"funder_award_id":"PN-III-P4-PCE-2021-0720","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"},{"id":"https://openalex.org/F4320338337","display_name":"H2020 Marie Sk\u0142odowska-Curie Actions","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1510825076","https://openalex.org/W1947202642","https://openalex.org/W1969811075","https://openalex.org/W1977109023","https://openalex.org/W1979089199","https://openalex.org/W2000769684","https://openalex.org/W2002745466","https://openalex.org/W2009941369","https://openalex.org/W2014421268","https://openalex.org/W2021361347","https://openalex.org/W2023901033","https://openalex.org/W2027982384","https://openalex.org/W2056636001","https://openalex.org/W2072265605","https://openalex.org/W2075660001","https://openalex.org/W2082639035","https://openalex.org/W2084453552","https://openalex.org/W2087714402","https://openalex.org/W2095984592","https://openalex.org/W2117686388","https://openalex.org/W2336104608","https://openalex.org/W2535496140","https://openalex.org/W2592062427","https://openalex.org/W2971617498","https://openalex.org/W2990601391","https://openalex.org/W3023715402","https://openalex.org/W3025858149","https://openalex.org/W3098745759","https://openalex.org/W3112051302","https://openalex.org/W3120198024","https://openalex.org/W3170429821","https://openalex.org/W3217620259","https://openalex.org/W4236218737","https://openalex.org/W4239308190","https://openalex.org/W4254313632"],"related_works":["https://openalex.org/W4286857066","https://openalex.org/W4238239967","https://openalex.org/W1677518548","https://openalex.org/W3213958552","https://openalex.org/W2949926331","https://openalex.org/W2754545762","https://openalex.org/W4299562540","https://openalex.org/W4297812081","https://openalex.org/W4298208753","https://openalex.org/W3175273680"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,41],"consider":[4],"large-scale":[5],"composite":[6,63,75],"optimization":[7],"problems":[8],"having":[9],"the":[10,31,56,62,66,70,74,78,82,86,108,121,125,148,161],"objective":[11,67,79,126],"function":[12],"formed":[13],"as":[14,55],"a":[15,24,90,112,130],"sum":[16],"of":[17,65,77,85,163],"two":[18,45,137,165],"terms":[19],"(possibly":[20],"nonconvex);":[21],"one":[22],"has":[23],"(block)":[25,149],"coordinatewise":[26],"Lipschitz":[27],"continuous":[28],"gradient":[29,59,84,92,110],"and":[30,43,80,143],"other":[32,71],"is":[33],"differentiable":[34],"but":[35],"nonseparable.":[36],"Under":[37],"these":[38,103,136],"general":[39],"settings":[40],"derive":[42],"analyze":[44],"new":[46,104,138],"coordinate":[47,57,91,109],"descent":[48,93,113],"methods.":[49],"The":[50],"first":[51],"algorithm,":[52],"referred":[53],"to":[54],"proximal":[58],"method,":[60,114],"considers":[61],"form":[64,76],"function,":[68],"while":[69],"algorithm":[72],"disregards":[73],"uses":[81],"partial":[83],"full":[87],"objective,":[88],"yielding":[89],"scheme":[94,111],"with":[95],"novel":[96],"adaptive":[97],"stepsize":[98,105],"rules.":[99],"We":[100,128],"prove":[101],"that":[102,116,147],"rules":[106],"make":[107],"provided":[115,146],"additional":[117],"assumptions":[118],"hold":[119],"for":[120,135,167],"second":[122],"term":[123],"in":[124,140],"function.":[127],"present":[129],"complete":[131],"worst-case":[132],"complexity":[133],"analysis":[134],"methods":[139],"both":[141],"convex":[142],"nonconvex":[144],"settings,":[145],"coordinates":[150],"are":[151],"chosen":[152],"random":[153],"or":[154],"cyclic.":[155],"Preliminary":[156],"numerical":[157],"results":[158],"also":[159],"confirm":[160],"efficiency":[162],"our":[164],"algorithms":[166],"practical":[168],"problems.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2023-08-18T00:00:00"}