{"id":"https://openalex.org/W4387667441","doi":"https://doi.org/10.1137/22m1494270","title":"A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization","display_name":"A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization","publication_year":2023,"publication_date":"2023-10-16","ids":{"openalex":"https://openalex.org/W4387667441","doi":"https://doi.org/10.1137/22m1494270"},"language":"en","primary_location":{"id":"doi:10.1137/22m1494270","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1494270","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://discovery.dundee.ac.uk/en/publications/4e91dee3-d755-45ba-9f26-b268d7b25f57","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017796051","display_name":"Spyridon Pougkakiotis","orcid":"https://orcid.org/0000-0001-7903-9335"},"institutions":[{"id":"https://openalex.org/I177639307","display_name":"University of Dundee","ror":"https://ror.org/03h2bxq36","country_code":"GB","type":"education","lineage":["https://openalex.org/I177639307"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Spyridon Pougkakiotis","raw_affiliation_strings":["School of Science and Engineering, University of Dundee, Dundee, Scotland DD1 4HR, UK"],"affiliations":[{"raw_affiliation_string":"School of Science and Engineering, University of Dundee, Dundee, Scotland DD1 4HR, UK","institution_ids":["https://openalex.org/I177639307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091493591","display_name":"Dionysios S. Kalogerias","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dionysis Kalogerias","raw_affiliation_strings":["Department of Electrical Engineering, Yale University, New Haven, CT 06511 USA ()"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Yale University, New Haven, CT 06511 USA ()","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017796051"],"corresponding_institution_ids":["https://openalex.org/I177639307"],"apc_list":null,"apc_paid":null,"fwci":1.3754,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85109567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"45","issue":"5","first_page":"A2679","last_page":"A2702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994999766349792,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991999864578247,"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/T10136","display_name":"Statistical Methods and Inference","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/stochastic-optimization","display_name":"Stochastic optimization","score":0.6246334910392761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.577274739742279},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5616466403007507},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.5607932209968567},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.5349885821342468},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.5159764885902405},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.4921512007713318},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.47791701555252075},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46273478865623474},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43015506863594055},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.424790620803833},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4148719906806946},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4117926359176636},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.40964603424072266},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3820599615573883},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3053280711174011},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2389533817768097},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.09611505270004272}],"concepts":[{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.6246334910392761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.577274739742279},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5616466403007507},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.5607932209968567},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.5349885821342468},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.5159764885902405},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.4921512007713318},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.47791701555252075},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46273478865623474},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43015506863594055},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.424790620803833},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4148719906806946},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4117926359176636},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.40964603424072266},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3820599615573883},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3053280711174011},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2389533817768097},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.09611505270004272},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":3,"locations":[{"id":"doi:10.1137/22m1494270","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1494270","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:discovery.dundee.ac.uk:openaire/4e91dee3-d755-45ba-9f26-b268d7b25f57","is_oa":true,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/4e91dee3-d755-45ba-9f26-b268d7b25f57","pdf_url":null,"source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pougkakiotis, S & Kalogerias, D 2023, 'A zeroth-order proximal stochastic gradient method for weakly convex stochastic optimization', SIAM Journal on Scientific Computing, vol. 45, no. 5. https://doi.org/10.1137/22M1494270","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/738568e5-f65f-4bd5-9701-97a081410af7","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/738568e5-f65f-4bd5-9701-97a081410af7","pdf_url":"https://arxiv.org/pdf/2205.01633","source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pougkakiotis, S & Kalogerias, D 2023, 'A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization', SIAM JOURNAL ON SCIENTIFIC COMPUTING, vol. 45, no. 5. https://doi.org/10.1137/22M1494270","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:discovery.dundee.ac.uk:openaire/4e91dee3-d755-45ba-9f26-b268d7b25f57","is_oa":true,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/4e91dee3-d755-45ba-9f26-b268d7b25f57","pdf_url":null,"source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pougkakiotis, S & Kalogerias, D 2023, 'A zeroth-order proximal stochastic gradient method for weakly convex stochastic optimization', SIAM Journal on Scientific Computing, vol. 45, no. 5. https://doi.org/10.1137/22M1494270","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W181733065","https://openalex.org/W1549918636","https://openalex.org/W1647779468","https://openalex.org/W1808259974","https://openalex.org/W1820125862","https://openalex.org/W1953936588","https://openalex.org/W2000985550","https://openalex.org/W2068480996","https://openalex.org/W2083811707","https://openalex.org/W2091849172","https://openalex.org/W2123859926","https://openalex.org/W2124289529","https://openalex.org/W2126042051","https://openalex.org/W2128452997","https://openalex.org/W2136722618","https://openalex.org/W2141307884","https://openalex.org/W2142506503","https://openalex.org/W2149479912","https://openalex.org/W2150329826","https://openalex.org/W2167025288","https://openalex.org/W2171830216","https://openalex.org/W2294586855","https://openalex.org/W2604272474","https://openalex.org/W2616678780","https://openalex.org/W2907514291","https://openalex.org/W2962914151","https://openalex.org/W2963190258","https://openalex.org/W2963470657","https://openalex.org/W2963534244","https://openalex.org/W2963740496","https://openalex.org/W2990138404","https://openalex.org/W2996447514","https://openalex.org/W2996611387","https://openalex.org/W3104684837","https://openalex.org/W3136297071","https://openalex.org/W3164950756","https://openalex.org/W3181693521","https://openalex.org/W3198503994","https://openalex.org/W4211116959","https://openalex.org/W4212774754","https://openalex.org/W4249513058","https://openalex.org/W4292363360"],"related_works":["https://openalex.org/W2804400349","https://openalex.org/W2964186284","https://openalex.org/W4297153560","https://openalex.org/W2905950575","https://openalex.org/W2073750241","https://openalex.org/W2012437081","https://openalex.org/W1863473538","https://openalex.org/W4221167213","https://openalex.org/W4319831228","https://openalex.org/W2920841750"],"abstract_inverted_index":{"In":[0,165],"this":[1],"paper":[2],"we":[3,148,167],"analyze":[4],"a":[5,52,74,82,100,137,142,179,189],"zeroth-order":[6,48,119,132],"proximal":[7,84,190],"stochastic":[8,18,26,85,138],"gradient":[9,49,86],"method":[10,120,156,193],"suitable":[11],"for":[12,29,88,116,196],"the":[13,40,62,67,89,93,106,117,150,158,172,197],"minimization":[14],"of":[15,51,61,92,108,154,161,174,194,199],"weakly":[16],"convex":[17],"optimization":[19,175],"problems.":[20],"We":[21,111],"consider":[22],"nonsmooth":[23,64],"and":[24,104,152],"nonlinear":[25],"composite":[27],"problems,":[28,204],"which":[30,45,59,96],"(sub)gradient":[31],"information":[32],"might":[33],"be":[34],"unavailable.":[35],"The":[36,124,183],"proposed":[37,118,125,184],"algorithm":[38],"utilizes":[39],"well-known":[41],"Gaussian":[42],"smoothing":[43,102],"technique,":[44],"yields":[46],"unbiased":[47],"estimators":[50],"related":[53],"partially":[54],"smooth":[55,75],"surrogate":[56,94],"problem":[57],"(in":[58],"one":[60],"two":[63],"terms":[65],"in":[66,157],"original":[68],"problem's":[69],"objective":[70],"is":[71,97,127,186],"replaced":[72],"by":[73,99,177],"approximation).":[76],"This":[77],"allows":[78],"us":[79],"to":[80],"employ":[81],"standard":[83,143],"scheme":[87,126,140],"approximate":[90],"solution":[91,198],"problem,":[95],"determined":[98],"single":[101],"parameter,":[103],"without":[105],"utilization":[107],"first-order":[109],"information.":[110],"provide":[112],"state-of-the-art":[113],"convergence":[114],"rates":[115],"using":[121],"minimal":[122],"assumptions.":[123],"numerically":[128],"compared":[129],"against":[130],"alternative":[131],"methods":[133],"as":[134,136],"well":[135],"subgradient":[139],"on":[141,169,188],"phase":[144],"retrieval":[145],"problem.":[146],"Further,":[147],"showcase":[149],"usefulness":[151],"effectiveness":[153],"our":[155],"unique":[159],"setting":[160],"automated":[162],"hyperparameter":[163],"tuning.":[164],"particular,":[166],"focus":[168],"automatically":[170],"tuning":[171],"parameters":[173],"algorithms":[176],"minimizing":[178],"novel":[180],"heuristic":[181],"model.":[182],"approach":[185],"tested":[187],"alternating":[191],"direction":[192],"multipliers":[195],"\\scrL1/\\scrL2-regularized":[200],"PDE-constrained":[201],"optimal":[202],"control":[203],"with":[205],"evident":[206],"empirical":[207],"success.":[208]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}