{"id":"https://openalex.org/W2228647872","doi":"https://doi.org/10.1137/14096757x","title":"An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems","display_name":"An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2228647872","doi":"https://doi.org/10.1137/14096757x","mag":"2228647872"},"language":"en","primary_location":{"id":"doi:10.1137/14096757x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14096757x","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/A5077050764","display_name":"Yunlong He","orcid":"https://orcid.org/0000-0002-0839-4353"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yunlong He","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Renato D. C. Monteiro","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077050764"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.4252,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.99708455,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"26","issue":"1","first_page":"29","last_page":"56"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9997000098228455,"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.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8085204362869263},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.7880629301071167},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.6666186451911926},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6307964324951172},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.556914746761322},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.463126003742218},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4592532813549042},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44997626543045044},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4451161324977875},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.42472535371780396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1563200056552887},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08514037728309631},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06776410341262817}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8085204362869263},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.7880629301071167},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.6666186451911926},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6307964324951172},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.556914746761322},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.463126003742218},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4592532813549042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44997626543045044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4451161324977875},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.42472535371780396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1563200056552887},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08514037728309631},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06776410341262817},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/14096757x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14096757x","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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W19898668","https://openalex.org/W163258351","https://openalex.org/W257907672","https://openalex.org/W1499439642","https://openalex.org/W1519983590","https://openalex.org/W1966953121","https://openalex.org/W1998991750","https://openalex.org/W2007437458","https://openalex.org/W2038497950","https://openalex.org/W2055467852","https://openalex.org/W2084777452","https://openalex.org/W2084845949","https://openalex.org/W2089559088","https://openalex.org/W2092663520","https://openalex.org/W2092851214","https://openalex.org/W2094631364","https://openalex.org/W2100556411","https://openalex.org/W2114423093","https://openalex.org/W2116174279","https://openalex.org/W2138216979","https://openalex.org/W2164224215","https://openalex.org/W2167732364"],"related_works":["https://openalex.org/W2383807498","https://openalex.org/W1978572805","https://openalex.org/W1997992934","https://openalex.org/W1987225439","https://openalex.org/W4238188170","https://openalex.org/W2125114371","https://openalex.org/W1793337513","https://openalex.org/W2296389180","https://openalex.org/W3200004281","https://openalex.org/W4294611394"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,8,19,30,62,70,109],"new":[4,16,48,129],"algorithm":[5,17],"for":[6,54,80],"solving":[7],"class":[9,83],"of":[10,22,43,46,58,65,84,93,135],"composite":[11],"convex-concave":[12],"saddle-point":[13,85],"problems.":[14,86],"The":[15],"is":[18,34,50,112],"special":[20],"instance":[21],"the":[23,39,44,47,66,73,81,90,128],"hybrid":[24],"proximal":[25,59,117],"extragradient":[26],"framework":[27],"in":[28],"which":[29],"Nesterov":[31],"accelerated":[32,103],"variant":[33],"used":[35],"to":[36,89,115],"approximately":[37],"solve":[38],"prox":[40],"subproblems.":[41],"One":[42],"advantages":[45],"method":[49,71,104,130],"that":[51,108,127],"it":[52],"works":[53],"any":[55],"constant":[56],"choice":[57,64],"stepsize.":[60],"Moreover,":[61],"suitable":[63],"latter":[67],"stepsize":[68],"yields":[69],"with":[72],"best":[74],"known":[75],"(accelerated":[76],"inner)":[77],"iteration":[78],"complexity":[79],"aforementioned":[82],"In":[87],"contrast":[88],"smoothing":[91,133],"technique":[92,134],"[Y.":[94,136],"Nesterov,":[95,137],"Math.":[96,138],"Program.,":[97,139],"103":[98,140],"(2005),":[99,141],"pp.":[100,142],"127--152],":[101],"our":[102],"does":[105],"not":[106],"assume":[107],"feasible":[110],"set":[111],"bounded":[113],"due":[114],"its":[116],"point":[118],"nature.":[119],"Experiment":[120],"results":[121],"on":[122],"three":[123],"problem":[124],"sets":[125],"show":[126],"outperforms":[131],"Nesterov's":[132],"127--152].":[143]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2}],"updated_date":"2026-02-26T08:16:20.718346","created_date":"2025-10-10T00:00:00"}