{"id":"https://openalex.org/W4400946369","doi":"https://doi.org/10.23919/ecc64448.2024.10591311","title":"Unified Analysis of Stochastic Gradient Projection Methods for Convex Optimization with Functional Constraints","display_name":"Unified Analysis of Stochastic Gradient Projection Methods for Convex Optimization with Functional Constraints","publication_year":2024,"publication_date":"2024-06-25","ids":{"openalex":"https://openalex.org/W4400946369","doi":"https://doi.org/10.23919/ecc64448.2024.10591311"},"language":"en","primary_location":{"id":"doi:10.23919/ecc64448.2024.10591311","is_oa":false,"landing_page_url":"http://dx.doi.org/10.23919/ecc64448.2024.10591311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 European Control Conference (ECC)","raw_type":"proceedings-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/A5103326026","display_name":"Nitesh Kumar Singh","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Nitesh Kumar Singh","raw_affiliation_strings":["National University of Science and Technology Politehnica Bucharest,Automatic Control and Systems Engineering Department,Bucharest,Romania,060042"],"affiliations":[{"raw_affiliation_string":"National University of Science and Technology Politehnica Bucharest,Automatic Control and Systems Engineering Department,Bucharest,Romania,060042","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["National University of Science and Technology Politehnica Bucharest,Automatic Control and Systems Engineering Department,Bucharest,Romania,060042"],"affiliations":[{"raw_affiliation_string":"National University of Science and Technology Politehnica Bucharest,Automatic Control and Systems Engineering Department,Bucharest,Romania,060042","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103326026"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.3637,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64845375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"3600","last_page":"3605"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9747999906539917,"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.9747999906539917,"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.9710000157356262,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9243999719619751,"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/computer-science","display_name":"Computer science","score":0.5708526372909546},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.551886260509491},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.540818452835083},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5172127485275269},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.4807174503803253},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4748701751232147},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.45269590616226196},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.452439546585083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3310849070549011},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27253592014312744}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5708526372909546},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.551886260509491},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.540818452835083},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5172127485275269},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.4807174503803253},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4748701751232147},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.45269590616226196},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.452439546585083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3310849070549011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27253592014312744},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc64448.2024.10591311","is_oa":false,"landing_page_url":"http://dx.doi.org/10.23919/ecc64448.2024.10591311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 European Control Conference (ECC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1505731132","https://openalex.org/W1946620893","https://openalex.org/W1965073581","https://openalex.org/W1977777127","https://openalex.org/W1994616650","https://openalex.org/W2030121914","https://openalex.org/W2592062427","https://openalex.org/W2769644379","https://openalex.org/W2901838001","https://openalex.org/W2964112534","https://openalex.org/W3025544109","https://openalex.org/W3106348863","https://openalex.org/W3130318025","https://openalex.org/W3205500484","https://openalex.org/W4200275590","https://openalex.org/W4224251874","https://openalex.org/W4254721730","https://openalex.org/W4301435544","https://openalex.org/W4324349864","https://openalex.org/W6680257277","https://openalex.org/W6713564840","https://openalex.org/W6746200960","https://openalex.org/W6758735094","https://openalex.org/W6763214872","https://openalex.org/W6811025068","https://openalex.org/W6850431676","https://openalex.org/W7071374342"],"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/W2348618647","https://openalex.org/W2112389317"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"a":[3,8,25,30,51,65,101,113],"unified":[4,107],"convergence":[5,102,119],"analysis":[6,103],"for":[7,16,124],"large":[9],"family":[10],"of":[11,55,104,137],"stochastic":[12,52,77,108,125],"gradient":[13,47,78,109,126],"projection":[14,110],"algorithms":[15],"dealing":[17],"with":[18,24,72],"constrained":[19],"finite":[20],"sum":[21],"convex":[22],"problems,":[23],"smooth":[26],"objective":[27,57],"function":[28,58],"satisfying":[29],"strong":[31],"convexity":[32],"condition":[33],"and":[34,63],"possibly":[35],"nonsmooth":[36],"functional":[37],"constraints.":[38,75],"At":[39],"each":[40],"iteration,":[41],"the":[42,56,69,105,135],"algorithm":[43,111],"takes":[44],"an":[45],"optimal":[46,123],"step":[48,67],"based":[49],"on":[50],"unbiased":[53],"estimate":[54,79],"aiming":[59],"to":[60],"minimize":[61],"it":[62],"then":[64],"feasibility":[66],"reducing":[68],"infeasibility":[70],"associated":[71],"randomly":[73],"observed":[74],"Our":[76],"can":[80],"take":[81],"diverse":[82],"forms":[83],"(e.g.,":[84],"Stochastic":[85,89],"Gradient":[86,91,97],"Descent":[87],"(SGD),":[88],"Average":[90],"Acceleration":[92],"(SAGA),":[93],"Loopless-Stochastic":[94],"Variance":[95],"Reduced":[96],"(L-SVRG).":[98],"We":[99],"conduct":[100],"proposed":[106],"under":[112],"diminishing":[114],"stepsize,":[115],"resulting":[116],"in":[117],"sublinear":[118],"rates,":[120],"which":[121],"are":[122],"methods":[127],"within":[128],"this":[129],"problem":[130],"class.":[131],"Numerical":[132],"evidence":[133],"supports":[134],"effectiveness":[136],"our":[138],"approach.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-19T19:40:27.379048","created_date":"2025-10-10T00:00:00"}