{"id":"https://openalex.org/W3043533097","doi":"https://doi.org/10.1137/19m1299049","title":"Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems","display_name":"Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3043533097","doi":"https://doi.org/10.1137/19m1299049","mag":"3043533097"},"language":"en","primary_location":{"id":"doi:10.1137/19m1299049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1299049","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/A5068750984","display_name":"Guoyong Gu","orcid":"https://orcid.org/0000-0003-4933-0679"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Guoyong Gu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056288677","display_name":"Junfeng Yang","orcid":"https://orcid.org/0000-0003-1981-6424"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Junfeng Yang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068750984"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0228,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.89690139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"30","issue":"3","first_page":"1905","last_page":"1921"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9997000098228455,"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.9997000098228455,"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.9986000061035156,"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.9962000250816345,"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/sublinear-function","display_name":"Sublinear function","score":0.9388711452484131},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8716273307800293},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.7284069657325745},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6413096189498901},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.620529294013977},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5308464765548706},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45246055722236633},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38887524604797363},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3728668689727783},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3685430884361267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34276270866394043},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.23527732491493225},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07902762293815613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.055681824684143066}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.9388711452484131},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8716273307800293},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.7284069657325745},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6413096189498901},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.620529294013977},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5308464765548706},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45246055722236633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38887524604797363},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3728668689727783},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3685430884361267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34276270866394043},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.23527732491493225},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07902762293815613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.055681824684143066},{"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},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/19m1299049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1299049","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":[{"id":"https://metadata.un.org/sdg/10","score":0.7699999809265137,"display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G4151278524","display_name":null,"funder_award_id":"11671195","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7534245485","display_name":null,"funder_award_id":"11922111","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7804408249","display_name":null,"funder_award_id":"11771208","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1547678669","https://openalex.org/W1825307613","https://openalex.org/W1931370844","https://openalex.org/W1953936588","https://openalex.org/W1962121538","https://openalex.org/W1979896658","https://openalex.org/W2003372231","https://openalex.org/W2010134289","https://openalex.org/W2019569173","https://openalex.org/W2037679050","https://openalex.org/W2038497950","https://openalex.org/W2042261731","https://openalex.org/W2050137601","https://openalex.org/W2057624533","https://openalex.org/W2058532290","https://openalex.org/W2095030074","https://openalex.org/W2099679613","https://openalex.org/W2100556411","https://openalex.org/W2135779729","https://openalex.org/W2473376220","https://openalex.org/W2508323711","https://openalex.org/W2512211375","https://openalex.org/W2615571142","https://openalex.org/W2951335402","https://openalex.org/W2953231121","https://openalex.org/W3098494876","https://openalex.org/W3100902858","https://openalex.org/W3102299214","https://openalex.org/W3104749043"],"related_works":["https://openalex.org/W90906771","https://openalex.org/W2018828772","https://openalex.org/W2529185025","https://openalex.org/W4375870324","https://openalex.org/W2945629716","https://openalex.org/W4283775266","https://openalex.org/W3043533097","https://openalex.org/W4298860769","https://openalex.org/W2767126220","https://openalex.org/W3007770227"],"abstract_inverted_index":{"The":[0,106],"tight":[1,31,86,139],"sublinear":[2,32,64,87,134],"convergence":[3,33,135],"rate":[4,34,65,125],"of":[5,142],"the":[6,19,26,30,60,62,76,85,90,111,116,123,131,144,147],"proximal":[7],"point":[8,22],"algorithm":[9],"for":[10,84],"maximal":[11],"monotone":[12],"inclusion":[13],"problems":[14],"is":[15,36,46,66,82,99,138],"established":[16,130],"based":[17],"on":[18],"squared":[20],"fixed":[21],"residual.":[23],"By":[24,58],"using":[25],"performance":[27],"estimation":[28],"framework,":[29],"problem":[35],"written":[37],"as":[38,50],"an":[39,79,93],"infinite":[40],"dimensional":[41,53,97],"nonconvex":[42],"optimization":[43],"problem,":[44],"which":[45,119,137],"then":[47],"equivalently":[48],"reformulated":[49],"a":[51,72,103],"finite":[52],"semidefinite":[54],"programming":[55],"(SDP)":[56],"problem.":[57],"solving":[59],"SDP,":[61,78,118],"exact":[63],"computed":[67],"numerically.":[68],"Theoretically,":[69],"by":[70],"constructing":[71],"feasible":[73],"solution":[74],"to":[75,101],"dual":[77,117],"upper":[80,112],"bound":[81,108,113],"obtained":[83,114],"rate.":[88],"On":[89],"other":[91],"hand,":[92],"example":[94],"in":[95,140],"two":[96],"space":[98],"constructed":[100],"provide":[102],"lower":[104,107],"bound.":[105],"matches":[109],"exactly":[110],"from":[115],"also":[120],"coincides":[121],"with":[122],"numerical":[124],"computed.":[126],"Hence,":[127],"we":[128],"have":[129],"worst":[132],"case":[133],"rate,":[136],"terms":[141],"both":[143],"order":[145],"and":[146],"constants":[148],"involved.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}