{"id":"https://openalex.org/W2565382733","doi":"https://doi.org/10.1080/10556788.2016.1266355","title":"An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex\u2013concave saddle-point problems","display_name":"An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex\u2013concave saddle-point problems","publication_year":2016,"publication_date":"2016-12-20","ids":{"openalex":"https://openalex.org/W2565382733","doi":"https://doi.org/10.1080/10556788.2016.1266355","mag":"2565382733"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2016.1266355","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1266355","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5023155790","display_name":"O. Kolossoski","orcid":"https://orcid.org/0000-0003-2543-9346"},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"O. Kolossoski","raw_affiliation_strings":["Departamento de Matem\u00e1tica, Universidade Federal do Paran\u00e1, Curitiba, PR 81531-990, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Matem\u00e1tica, Universidade Federal do Paran\u00e1, Curitiba, PR 81531-990, Brazil","institution_ids":["https://openalex.org/I52418104"]}]},{"author_position":"last","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":"R.D.C. Monteiro","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023155790"],"corresponding_institution_ids":["https://openalex.org/I52418104"],"apc_list":null,"apc_paid":null,"fwci":3.5832,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.92699542,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"32","issue":"6","first_page":"1244","last_page":"1272"},"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.9961000084877014,"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.9961000084877014,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9955999851226807,"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.9921000003814697,"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.7901011109352112},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.7700569033622742},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7282270789146423},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.650152325630188},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5712920427322388},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5044878721237183},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.48313257098197937},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.48072293400764465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44975370168685913},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43669217824935913},{"id":"https://openalex.org/keywords/bregman-divergence","display_name":"Bregman divergence","score":0.43584901094436646},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37448012828826904},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32700687646865845},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09970548748970032}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7901011109352112},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.7700569033622742},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7282270789146423},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.650152325630188},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5712920427322388},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5044878721237183},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.48313257098197937},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.48072293400764465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44975370168685913},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43669217824935913},{"id":"https://openalex.org/C149073432","wikidata":"https://www.wikidata.org/wiki/Q4960382","display_name":"Bregman divergence","level":2,"score":0.43584901094436646},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37448012828826904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32700687646865845},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09970548748970032},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2016.1266355","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1266355","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G857784196","display_name":null,"funder_award_id":"99999.003842/2014-02","funder_id":"https://openalex.org/F4320321091","funder_display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior"}],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W163258351","https://openalex.org/W240703482","https://openalex.org/W257907672","https://openalex.org/W1519983590","https://openalex.org/W1966953121","https://openalex.org/W2004304255","https://openalex.org/W2048992473","https://openalex.org/W2055467852","https://openalex.org/W2067272684","https://openalex.org/W2082305681","https://openalex.org/W2084777452","https://openalex.org/W2084845949","https://openalex.org/W2089559088","https://openalex.org/W2090376964","https://openalex.org/W2092851214","https://openalex.org/W2094631364","https://openalex.org/W2105717411","https://openalex.org/W2110412969","https://openalex.org/W2112980792","https://openalex.org/W2113940215","https://openalex.org/W2116174279","https://openalex.org/W2138216979","https://openalex.org/W2149454052","https://openalex.org/W2164224215","https://openalex.org/W2167732364","https://openalex.org/W2228647872","https://openalex.org/W2962823973","https://openalex.org/W4249513058","https://openalex.org/W4249667877"],"related_works":["https://openalex.org/W2790371392","https://openalex.org/W2140505738","https://openalex.org/W4200078764","https://openalex.org/W952002620","https://openalex.org/W4319453353","https://openalex.org/W3112976351","https://openalex.org/W2898694638","https://openalex.org/W2383807498","https://openalex.org/W3121912418","https://openalex.org/W4287368861"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3,67],"accelerated":[4,68,74,83,141],"HPE-type":[5,84,142],"method":[6,182,199],"based":[7,122],"on":[8,47,123],"general":[9,109,124],"Bregman":[10,51,125],"distances":[11,126],"for":[12,86,144,166,188],"solving":[13,189],"convex\u2013concave":[14,91,149],"saddle-point":[15,92,150],"(SP)":[16],"problems.":[17,192],"The":[18],"algorithm":[19,42,76,85,135,143],"is":[20,121,200],"a":[21,25,87,145,174,181],"special":[22],"instance":[23],"of":[24,50,89,114,128,136,147,170,177,206],"non-Euclidean":[26],"hybrid":[27,38],"proximal":[28,40,171],"extragradient":[29],"framework":[30],"introduced":[31],"by":[32],"Svaiter":[33],"and":[34,43,80,118,138],"Solodov":[35],"[An":[36,82,140],"inexact":[37],"generalized":[39],"point":[41],"some":[44],"new":[45,198],"results":[46,194],"the":[48,61,73,129,134,161,178,184,197],"theory":[49],"functions,":[52,208],"Math.":[53,209],"Oper.":[54],"Res.":[55],"25(2)":[56],"(2000),":[57],"pp.":[58,99,157,213],"214\u2013230]":[59],"where":[60],"prox":[62],"sub-inclusions":[63],"are":[64],"solved":[65],"using":[66],"gradient":[69],"method.":[70],"It":[71],"generalizes":[72],"HPE":[75],"presented":[77],"in":[78,101],"He":[79,137],"Monteiro":[81,139],"class":[88,146],"composite":[90,148],"problems,":[93,151],"SIAM":[94,152],"J.":[95,153],"Optim.":[96,154],"26":[97,155],"(2016),":[98,156],"29\u201356]":[100],"two":[102],"ways,":[103],"namely:":[104],"(a)":[105],"it":[106,120,159,164],"deals":[107],"with":[108,183],"monotone":[110,190],"SP":[111,191],"problems":[112],"instead":[113,127],"bilinear":[115],"structured":[116],"SPs":[117],"(b)":[119],"Euclidean":[130],"one.":[131],"Similar":[132],"to":[133,202],"29\u201356],":[158],"has":[160],"advantage":[162],"that":[163,196],"works":[165],"any":[167],"constant":[168],"choice":[169,176],"stepsize.":[172],"Moreover,":[173],"suitable":[175],"stepsize":[179],"yields":[180],"best":[185],"known":[186],"iteration-complexity":[187],"Computational":[193],"show":[195],"superior":[201],"Nesterov's":[203],"[Smooth":[204],"minimization":[205],"non-smooth":[207],"Program.":[210],"103(1)":[211],"(2005),":[212],"127\u2013152]":[214],"smoothing":[215],"scheme.":[216]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}