{"id":"https://openalex.org/W2094631364","doi":"https://doi.org/10.1137/110849468","title":"Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers","display_name":"Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2094631364","doi":"https://doi.org/10.1137/110849468","mag":"2094631364"},"language":"en","primary_location":{"id":"doi:10.1137/110849468","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110849468","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/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato D. C. Monteiro","raw_affiliation_strings":["[Georgia Institute of Technology.]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Georgia Institute of Technology.]","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053683082","display_name":"B. F. Svaiter","orcid":"https://orcid.org/0000-0003-3656-9883"},"institutions":[{"id":"https://openalex.org/I141883831","display_name":"Instituto Nacional de Matem\u00e1tica Pura e Aplicada","ror":"https://ror.org/028caqe42","country_code":"BR","type":"facility","lineage":["https://openalex.org/I141883831","https://openalex.org/I4210151455"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Benar F. Svaiter","raw_affiliation_strings":["Instituto Nacional de Matem\u00e1tica Pura e Aplicada,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto Nacional de Matem\u00e1tica Pura e Aplicada,","institution_ids":["https://openalex.org/I141883831"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":27.5621,"has_fulltext":false,"cited_by_count":207,"citation_normalized_percentile":{"value":0.99809988,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"23","issue":"1","first_page":"475","last_page":"507"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.998199999332428,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8303102254867554},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7212247848510742},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.6299833655357361},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5112299919128418},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4964020848274231},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4866850972175598},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48434126377105713},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.47419530153274536},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.47117239236831665},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.47030016779899597},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4452120065689087},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40308672189712524},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3315315246582031},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24768006801605225},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10798123478889465}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8303102254867554},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7212247848510742},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.6299833655357361},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5112299919128418},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4964020848274231},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4866850972175598},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48434126377105713},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.47419530153274536},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.47117239236831665},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.47030016779899597},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4452120065689087},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40308672189712524},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3315315246582031},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24768006801605225},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10798123478889465},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110849468","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110849468","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":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W158315004","https://openalex.org/W163258351","https://openalex.org/W171675148","https://openalex.org/W240703482","https://openalex.org/W257907672","https://openalex.org/W1519983590","https://openalex.org/W1543439990","https://openalex.org/W1965650079","https://openalex.org/W1966953121","https://openalex.org/W1968262474","https://openalex.org/W1999915705","https://openalex.org/W2004775756","https://openalex.org/W2007218093","https://openalex.org/W2036987405","https://openalex.org/W2038497950","https://openalex.org/W2039151776","https://openalex.org/W2045079045","https://openalex.org/W2046866204","https://openalex.org/W2055467852","https://openalex.org/W2069572432","https://openalex.org/W2081316950","https://openalex.org/W2084777452","https://openalex.org/W2084845949","https://openalex.org/W2089559088","https://openalex.org/W2092663520","https://openalex.org/W2116174279","https://openalex.org/W2120682042","https://openalex.org/W2138216979","https://openalex.org/W2164224215","https://openalex.org/W2169053534","https://openalex.org/W2244987555"],"related_works":["https://openalex.org/W1489292980","https://openalex.org/W2795079910","https://openalex.org/W2951610245","https://openalex.org/W1430963189","https://openalex.org/W3037410748","https://openalex.org/W2049901819","https://openalex.org/W2052430123","https://openalex.org/W1983437306","https://openalex.org/W1974262772","https://openalex.org/W4387778523"],"abstract_inverted_index":{"In":[0],"this":[1,64],"paper,":[2],"we":[3,83,110],"consider":[4,111],"the":[5,11,46,72,95,105,120,124,134,146,150,156,160],"monotone":[6,16,22,140],"inclusion":[7],"problem":[8],"consisting":[9],"of":[10,13,33,45,71,94,114,126,133,136,149,159,165,170],"sum":[12,135],"a":[14,19,25,31,68,131,144,168],"continuous":[15],"map":[17],"and":[18,29,81,100,154],"point-to-set":[20],"maximal":[21,139],"operator":[23],"with":[24,176],"separable":[26],"two-block":[27],"structure":[28],"introduce":[30],"framework":[32,65,96],"block-decomposition":[34],"prox-type":[35],"algorithms":[36],"for":[37,42,103,119,129,167],"solving":[38,104],"it":[39],"which":[40],"allows":[41],"each":[43],"one":[44],"single-block":[47,106],"proximal":[48,74,107],"subproblems":[49],"to":[50,117],"be":[51],"solved":[52],"in":[53,63],"an":[54,127],"approximate":[55],"sense.":[56],"Moreover,":[57],"by":[58,79],"showing":[59],"that":[60],"any":[61],"method":[62,77,153,164],"is":[66],"also":[67,90],"special":[69],"instance":[70],"hybrid":[73],"extragradient":[75],"(HPE)":[76],"introduced":[78],"Solodov":[80],"Svaiter,":[82],"derive":[84],"corresponding":[85],"convergence":[86],"rate":[87],"results.":[88],"We":[89],"describe":[91],"some":[92,112],"instances":[93],"based":[97],"on":[98],"specific":[99],"inexpensive":[101],"schemes":[102],"subproblems.":[108],"Finally,":[109],"applications":[113],"our":[115],"methodology":[116],"establish":[118],"first":[121],"time":[122],"(i)":[123],"iteration-complexity":[125,148,158],"algorithm":[128],"finding":[130],"zero":[132],"two":[137],"arbitrary":[138],"operators":[141],"and,":[142],"as":[143],"consequence,":[145],"ergodic":[147,157],"Douglas--Rachford":[151],"splitting":[152],"(ii)":[155],"classical":[161],"alternating":[162],"direction":[163],"multipliers":[166],"class":[169],"linearly":[171],"constrained":[172],"convex":[173,179],"programming":[174],"problems":[175],"proper":[177],"closed":[178],"objective":[180],"functions.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":19},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":27},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":30},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":9}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}