{"id":"https://openalex.org/W3035012470","doi":"https://doi.org/10.24963/ijcai.2020/201","title":"Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization","display_name":"Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3035012470","doi":"https://doi.org/10.24963/ijcai.2020/201","mag":"3035012470"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2020/201","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/201","pdf_url":"https://www.ijcai.org/proceedings/2020/0201.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2020/0201.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101704070","display_name":"Yi Zhou","orcid":"https://orcid.org/0000-0002-3982-9145"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yi Zhou","raw_affiliation_strings":["University of Utah"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Utah","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100407604","display_name":"Zhe Wang","orcid":"https://orcid.org/0000-0002-1698-2761"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhe Wang","raw_affiliation_strings":["The Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071973105","display_name":"Kaiyi Ji","orcid":"https://orcid.org/0000-0002-9533-0058"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kaiyi Ji","raw_affiliation_strings":["The Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100384384","display_name":"Yingbin Liang","orcid":"https://orcid.org/0000-0003-2631-4262"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yingbin Liang","raw_affiliation_strings":["The Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020766546","display_name":"Vahid Tarokh","orcid":"https://orcid.org/0000-0003-2994-6302"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vahid Tarokh","raw_affiliation_strings":["Duke University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke University","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101704070"],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1445","last_page":"1451"},"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.9994999766349792,"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.9994999766349792,"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.9976000189781189,"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.9602000117301941,"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/convergence","display_name":"Convergence (economics)","score":0.7394447922706604},{"id":"https://openalex.org/keywords/momentum","display_name":"Momentum (technical analysis)","score":0.6192399263381958},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5962299704551697},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5746528506278992},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5468371510505676},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5080695152282715},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.4696578085422516},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.43027663230895996},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41067641973495483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40845856070518494},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.3796997666358948},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3246139585971832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3233911991119385},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.059760093688964844}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7394447922706604},{"id":"https://openalex.org/C60718061","wikidata":"https://www.wikidata.org/wiki/Q1414747","display_name":"Momentum (technical analysis)","level":2,"score":0.6192399263381958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5962299704551697},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5746528506278992},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5468371510505676},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5080695152282715},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.4696578085422516},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.43027663230895996},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41067641973495483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40845856070518494},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3796997666358948},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3246139585971832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3233911991119385},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.059760093688964844},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2020/201","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/201","pdf_url":"https://www.ijcai.org/proceedings/2020/0201.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2020/201","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/201","pdf_url":"https://www.ijcai.org/proceedings/2020/0201.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1194184183","display_name":"CIF: Medium: Collaborative Research: Nonconvex Optimization for High-Dimensional Signal Estimation: Theory and Fast Algorithms","funder_award_id":"1761506","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3594470933","display_name":null,"funder_award_id":"CCF-1909291","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5920574633","display_name":null,"funder_award_id":"CCF-1761506","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G663170338","display_name":"CIF: Small: Collaborative Research: Acceleration Algorithms for Large-scale Nonconvex Optimization","funder_award_id":"1909291","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G731109766","display_name":"CIF: Medium: Collaborative Research: Theory of Optimization Geometry and Algorithms for Neural Networks","funder_award_id":"1900145","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035012470.pdf","grobid_xml":"https://content.openalex.org/works/W3035012470.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1967138577","https://openalex.org/W1986046400","https://openalex.org/W1987083649","https://openalex.org/W2027982384","https://openalex.org/W2029463628","https://openalex.org/W2045096911","https://openalex.org/W2078853581","https://openalex.org/W2100556411","https://openalex.org/W2101868363","https://openalex.org/W2127447444","https://openalex.org/W2146482778","https://openalex.org/W2184634347","https://openalex.org/W2351849545","https://openalex.org/W2419443760","https://openalex.org/W2524121306","https://openalex.org/W2616127482","https://openalex.org/W2753068038","https://openalex.org/W2753277175","https://openalex.org/W2885208219","https://openalex.org/W2898733481","https://openalex.org/W2949950906","https://openalex.org/W2962834223","https://openalex.org/W3100607587","https://openalex.org/W3120421331","https://openalex.org/W3141595720","https://openalex.org/W3141697399","https://openalex.org/W4298869431"],"related_works":["https://openalex.org/W2963086517","https://openalex.org/W2564735875","https://openalex.org/W3123504125","https://openalex.org/W3147739796","https://openalex.org/W1983212821","https://openalex.org/W3127841625","https://openalex.org/W2811217697","https://openalex.org/W2364728921","https://openalex.org/W4292651679","https://openalex.org/W1543207628"],"abstract_inverted_index":{"Various":[0],"types":[1,102],"of":[2,28,103,111,126],"parameter":[3,24,52,70],"restart":[4,53,71],"schemes":[5,72],"have":[6,79,92,100],"been":[7],"proposed":[8,128],"for":[9,54,67],"proximal":[10,29,46],"gradient":[11,30,47],"algorithm":[12,31,48,61],"with":[13,32,49],"momentum":[14,33,50],"to":[15,64,95],"facilitate":[16],"their":[17],"convergence":[18,27,83,94,105,123],"in":[19,36,85,114],"convex":[20],"optimization.":[21,38,118],"However,":[22],"under":[23],"restart,":[25],"the":[26,109,122],"remains":[34],"obscure":[35],"nonconvex":[37,56,86,115],"In":[39],"this":[40],"paper,":[41],"we":[42],"propose":[43],"a":[44,80,96],"novel":[45],"and":[51,57,87,90,99,116,124],"solving":[55],"nonsmooth":[58,88,117],"problems.":[59],"Our":[60],"is":[62],"designed":[63],"1)":[65],"allow":[66],"adopting":[68],"flexible":[69],"that":[73],"cover":[74],"many":[75],"existing":[76],"ones;":[77],"2)":[78],"global":[81],"sub-linear":[82],"rate":[84],"optimization;":[89],"3)":[91],"guaranteed":[93],"critical":[97],"point":[98],"various":[101],"asymptotic":[104],"rates":[106],"depending":[107],"on":[108],"parameterization":[110],"local":[112],"geometry":[113],"Numerical":[119],"experiments":[120],"demonstrate":[121],"effectiveness":[125],"our":[127],"algorithm.":[129]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}