{"id":"https://openalex.org/W2241435520","doi":"https://doi.org/10.1007/s10107-015-0957-3","title":"On the ergodic convergence rates of a first-order primal\u2013dual algorithm","display_name":"On the ergodic convergence rates of a first-order primal\u2013dual algorithm","publication_year":2015,"publication_date":"2015-10-30","ids":{"openalex":"https://openalex.org/W2241435520","doi":"https://doi.org/10.1007/s10107-015-0957-3","mag":"2241435520"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-015-0957-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-015-0957-3","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5089573258","display_name":"Antonin Chambolle","orcid":"https://orcid.org/0000-0002-9465-4659"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Antonin Chambolle","raw_affiliation_strings":["CMAP, Ecole Polytechnique, CNRS, 91128, Palaiseau, France"],"affiliations":[{"raw_affiliation_string":"CMAP, Ecole Polytechnique, CNRS, 91128, Palaiseau, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I142476485"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032205387","display_name":"Thomas Pock","orcid":"https://orcid.org/0000-0001-6120-1058"},"institutions":[{"id":"https://openalex.org/I132118926","display_name":"Austrian Institute of Technology","ror":"https://ror.org/04knbh022","country_code":"AT","type":"facility","lineage":["https://openalex.org/I132118926"]},{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Thomas Pock","raw_affiliation_strings":["Digital Safety and Security Department, AIT Austrian Institute of Technology GmbH, 1220, Vienna, Austria","Institute for Computer Graphics and Vision, Graz University of Technology, 8010, Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Digital Safety and Security Department, AIT Austrian Institute of Technology GmbH, 1220, Vienna, Austria","institution_ids":["https://openalex.org/I132118926"]},{"raw_affiliation_string":"Institute for Computer Graphics and Vision, Graz University of Technology, 8010, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089573258"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I142476485"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":27.6517,"has_fulltext":false,"cited_by_count":416,"citation_normalized_percentile":{"value":0.99777234,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"159","issue":"1-2","first_page":"253","last_page":"287"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9973000288009644,"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.9972000122070312,"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/ergodic-theory","display_name":"Ergodic theory","score":0.8316890001296997},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8273112773895264},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.763573169708252},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6971465945243835},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5612540245056152},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5383191704750061},{"id":"https://openalex.org/keywords/compact-convergence","display_name":"Compact convergence","score":0.47889676690101624},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4648970663547516},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4494388997554779},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.44939523935317993},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4339252710342407},{"id":"https://openalex.org/keywords/modes-of-convergence","display_name":"Modes of convergence (annotated index)","score":0.43368303775787354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.394846111536026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3577333688735962},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30800914764404297},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.22266843914985657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12465396523475647}],"concepts":[{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.8316890001296997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8273112773895264},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.763573169708252},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6971465945243835},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5612540245056152},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5383191704750061},{"id":"https://openalex.org/C5871375","wikidata":"https://www.wikidata.org/wiki/Q1780715","display_name":"Compact convergence","level":4,"score":0.47889676690101624},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4648970663547516},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4494388997554779},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.44939523935317993},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4339252710342407},{"id":"https://openalex.org/C48216909","wikidata":"https://www.wikidata.org/wiki/Q6889156","display_name":"Modes of convergence (annotated index)","level":5,"score":0.43368303775787354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.394846111536026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3577333688735962},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30800914764404297},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.22266843914985657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12465396523475647},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C81332173","wikidata":"https://www.wikidata.org/wiki/Q179899","display_name":"Topological space","level":2,"score":0.0},{"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/C47776270","wikidata":"https://www.wikidata.org/wiki/Q1455249","display_name":"Topological vector space","level":3,"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/C174265945","wikidata":"https://www.wikidata.org/wiki/Q1142889","display_name":"Isolated point","level":4,"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.1007/s10107-015-0957-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-015-0957-3","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1674339644","display_name":null,"funder_award_id":"ANR-12-IS01-0003","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4318390797","display_name":null,"funder_award_id":"I1148","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320324478","display_name":"Fondation Math\u00e9matique Jacques Hadamard","ror":"https://ror.org/0153me927"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W199410564","https://openalex.org/W1503052358","https://openalex.org/W1505731132","https://openalex.org/W1973665846","https://openalex.org/W1978259121","https://openalex.org/W1981112674","https://openalex.org/W1986080131","https://openalex.org/W1998991750","https://openalex.org/W2009274429","https://openalex.org/W2016384870","https://openalex.org/W2021548137","https://openalex.org/W2038497950","https://openalex.org/W2042650576","https://openalex.org/W2053487511","https://openalex.org/W2058532290","https://openalex.org/W2061334381","https://openalex.org/W2071236014","https://openalex.org/W2079261074","https://openalex.org/W2089559088","https://openalex.org/W2090376964","https://openalex.org/W2092663520","https://openalex.org/W2092851214","https://openalex.org/W2095980290","https://openalex.org/W2100556411","https://openalex.org/W2112980792","https://openalex.org/W2114423093","https://openalex.org/W2124541940","https://openalex.org/W2167732364","https://openalex.org/W2235143186","https://openalex.org/W2544610656","https://openalex.org/W2951945076","https://openalex.org/W2964168652","https://openalex.org/W3123649567","https://openalex.org/W3141595720"],"related_works":["https://openalex.org/W2180233726","https://openalex.org/W2010584785","https://openalex.org/W4301012366","https://openalex.org/W2951349428","https://openalex.org/W4389263059","https://openalex.org/W4321392368","https://openalex.org/W2058880726","https://openalex.org/W2285605129","https://openalex.org/W2098075484","https://openalex.org/W4394643338"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":11},{"year":2025,"cited_by_count":35},{"year":2024,"cited_by_count":38},{"year":2023,"cited_by_count":37},{"year":2022,"cited_by_count":48},{"year":2021,"cited_by_count":98},{"year":2020,"cited_by_count":31},{"year":2019,"cited_by_count":40},{"year":2018,"cited_by_count":29},{"year":2017,"cited_by_count":23},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}