{"id":"https://openalex.org/W2960066928","doi":"https://doi.org/10.1137/19m127375x","title":"Convergence Rate of $\\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems","display_name":"Convergence Rate of $\\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2960066928","doi":"https://doi.org/10.1137/19m127375x","mag":"2960066928"},"language":"en","primary_location":{"id":"doi:10.1137/19m127375x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m127375x","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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1906.01115","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008417632","display_name":"Aryan Mokhtari","orcid":"https://orcid.org/0000-0001-6603-0091"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aryan Mokhtari","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6603-0091","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067307504","display_name":"Asuman Ozdaglar","orcid":"https://orcid.org/0000-0002-1827-1285"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Asuman E. Ozdaglar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053188368","display_name":"Sarath Pattathil","orcid":"https://orcid.org/0000-0001-7908-8209"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarath Pattathil","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7908-8209","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0418,"has_fulltext":true,"cited_by_count":30,"citation_normalized_percentile":{"value":0.96635759,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"30","issue":"4","first_page":"3230","last_page":"3251"},"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.9998000264167786,"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.9969000220298767,"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/saddle-point","display_name":"Saddle point","score":0.8209050893783569},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.8117374181747437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6864024996757507},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6019071340560913},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5484741926193237},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5147345066070557},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4874167740345001},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.48587459325790405},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.4794960618019104},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4537794888019562},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.44762086868286133},{"id":"https://openalex.org/keywords/concave-function","display_name":"Concave function","score":0.4323732554912567},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4313516616821289},{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.42930951714515686},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3481556475162506},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3291935324668884},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2985442876815796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17680811882019043},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10833320021629333}],"concepts":[{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.8209050893783569},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.8117374181747437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6864024996757507},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6019071340560913},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5484741926193237},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5147345066070557},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4874167740345001},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.48587459325790405},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.4794960618019104},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4537794888019562},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.44762086868286133},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.4323732554912567},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4313516616821289},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.42930951714515686},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3481556475162506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3291935324668884},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2985442876815796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17680811882019043},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10833320021629333},{"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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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":4,"locations":[{"id":"doi:10.1137/19m127375x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m127375x","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"},{"id":"pmh:oai:arXiv.org:1906.01115","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1906.01115","pdf_url":"https://arxiv.org/pdf/1906.01115","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2960066928","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1906.01115","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1906.01115","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1906.01115","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1906.01115","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1906.01115","pdf_url":"https://arxiv.org/pdf/1906.01115","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2960066928.pdf","grobid_xml":"https://content.openalex.org/works/W2960066928.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W163258351","https://openalex.org/W205960364","https://openalex.org/W1519983590","https://openalex.org/W1543439990","https://openalex.org/W1578630563","https://openalex.org/W1814433154","https://openalex.org/W1878322007","https://openalex.org/W1966953121","https://openalex.org/W2016939833","https://openalex.org/W2020123437","https://openalex.org/W2037679050","https://openalex.org/W2038497950","https://openalex.org/W2052769657","https://openalex.org/W2075226379","https://openalex.org/W2080844831","https://openalex.org/W2081985785","https://openalex.org/W2089559088","https://openalex.org/W2092663520","https://openalex.org/W2092851214","https://openalex.org/W2099471712","https://openalex.org/W2099679613","https://openalex.org/W2100556411","https://openalex.org/W2143343660","https://openalex.org/W2186453173","https://openalex.org/W2510358906","https://openalex.org/W2543381247","https://openalex.org/W2739748921","https://openalex.org/W2788053000","https://openalex.org/W2791323206","https://openalex.org/W2803117117","https://openalex.org/W2951445759","https://openalex.org/W2963114935","https://openalex.org/W2963647223","https://openalex.org/W2963809785","https://openalex.org/W2964334726","https://openalex.org/W3027891624","https://openalex.org/W3037593317","https://openalex.org/W3141595720"],"related_works":["https://openalex.org/W2089559088","https://openalex.org/W3037593317","https://openalex.org/W2964253222","https://openalex.org/W2099471712","https://openalex.org/W1519983590","https://openalex.org/W2948517632","https://openalex.org/W2971302301","https://openalex.org/W2964334726","https://openalex.org/W2081985785","https://openalex.org/W2081316950","https://openalex.org/W2075226379","https://openalex.org/W2038497950","https://openalex.org/W2970416783","https://openalex.org/W2963647223","https://openalex.org/W2894677249","https://openalex.org/W2788053000","https://openalex.org/W2970552792","https://openalex.org/W2964121860","https://openalex.org/W2895628298","https://openalex.org/W1543439990"],"abstract_inverted_index":{"We":[0,100,118],"study":[1],"the":[2,6,13,46,54,74,93,96,122,126,150,158,170],"iteration":[3],"complexity":[4],"of":[5,22,45,73,95,125,132,139,145,175],"optimistic":[7],"gradient":[8,94],"descent-ascent":[9],"(OGDA)":[10],"method":[11,16],"and":[12,37,88],"extragradient":[14],"(EG)":[15],"for":[17,155,169],"finding":[18],"a":[19,23,115,137,165,180],"saddle":[20],"point":[21,48,98],"convex-concave":[24,160],"unconstrained":[25],"min-max":[26],"problem.":[27],"To":[28],"do":[29],"so,":[30],"we":[31,81],"first":[32,151],"show":[33,106,120],"that":[34,107,112,121],"both":[35,108,131],"OGDA":[36,87,156],"EG":[38,69,89,171],"can":[39],"be":[40],"interpreted":[41],"as":[42,70,147],"approximate":[43,92],"variants":[44],"proximal":[47,97],"method.":[49,99],"This":[50],"is":[51,144],"similar":[52],"to":[53,91,105],"approach":[55],"taken":[56],"in":[57,86,157,173],"(A.":[58],"Nemirovski":[59],"(2004),":[60],"SIAM":[61],"J.":[62],"Optim.,":[63],"15,":[64],"pp.":[65],"229--251)":[66],"which":[67],"analyzes":[68],"an":[71],"approximation":[72],"\u201cconceptual":[75],"mirror":[76],"prox.\u201d":[77],"In":[78],"this":[79,103],"paper,":[80],"highlight":[82],"how":[83],"gradients":[84],"used":[85],"try":[90],"then":[101],"exploit":[102],"interpretation":[104],"algorithms":[109,134],"produce":[110],"iterates":[111,128],"remain":[113],"within":[114],"bounded":[116],"set.":[117],"further":[119],"primal-dual":[123],"gap":[124],"averaged":[127],"generated":[129],"by":[130],"these":[133],"converge":[135],"with":[136],"rate":[138,153],"$\\mathcal{O}(1/k)$.":[140],"Our":[141],"theoretical":[142],"analysis":[143,168],"interest":[146],"it":[148,163],"provides":[149,164],"convergence":[152,167],"estimate":[154],"general":[159],"setting.":[161],"Moreover,":[162],"simple":[166],"algorithm":[172],"terms":[174],"function":[176],"value":[177],"without":[178],"using":[179],"compactness":[181],"assumption.":[182]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}