{"id":"https://openalex.org/W4404037606","doi":"https://doi.org/10.1109/mlsp58920.2024.10734740","title":"Non-Convex Constrained Stochastic Successive Convex Approximation","display_name":"Non-Convex Constrained Stochastic Successive Convex Approximation","publication_year":2024,"publication_date":"2024-09-22","ids":{"openalex":"https://openalex.org/W4404037606","doi":"https://doi.org/10.1109/mlsp58920.2024.10734740"},"language":"en","primary_location":{"id":"doi:10.1109/mlsp58920.2024.10734740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mlsp58920.2024.10734740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 34th International Workshop on Machine Learning for Signal Processing (MLSP)","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/A5058652036","display_name":"Basil M. Idrees","orcid":"https://orcid.org/0000-0001-8588-6530"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Basil M. Idrees","raw_affiliation_strings":["Indian Institute of Technology Kanpur"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049489349","display_name":"Lavish Arora","orcid":"https://orcid.org/0000-0002-5796-6864"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Lavish Arora","raw_affiliation_strings":["Indian Institute of Technology Kanpur"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007246073","display_name":"Ketan Rajawat","orcid":"https://orcid.org/0000-0002-4508-0062"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ketan Rajawat","raw_affiliation_strings":["Indian Institute of Technology Kanpur"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058652036"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":1.518,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85042653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.935699999332428,"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.935699999332428,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9129999876022339,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6165465116500854},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.5997564196586609},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.582564115524292},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.5787885785102844},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.5416072607040405},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47558534145355225},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.4448963701725006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.438849538564682},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4346063733100891},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4339444637298584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35220420360565186},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09020045399665833}],"concepts":[{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6165465116500854},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.5997564196586609},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.582564115524292},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.5787885785102844},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.5416072607040405},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47558534145355225},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.4448963701725006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.438849538564682},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4346063733100891},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4339444637298584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35220420360565186},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09020045399665833}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mlsp58920.2024.10734740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mlsp58920.2024.10734740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 34th International Workshop on Machine Learning for Signal Processing (MLSP)","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":14,"referenced_works":["https://openalex.org/W2125062699","https://openalex.org/W2784709112","https://openalex.org/W2970623506","https://openalex.org/W2976677498","https://openalex.org/W2993258424","https://openalex.org/W2997816638","https://openalex.org/W3095525892","https://openalex.org/W3181247765","https://openalex.org/W4283397226","https://openalex.org/W4392510368","https://openalex.org/W4394973181","https://openalex.org/W6734509502","https://openalex.org/W6763249885","https://openalex.org/W6865078968"],"related_works":["https://openalex.org/W2026600343","https://openalex.org/W4382519084","https://openalex.org/W2478309485","https://openalex.org/W2376997122","https://openalex.org/W2356261519","https://openalex.org/W2040676043","https://openalex.org/W165488893","https://openalex.org/W4361807553","https://openalex.org/W2002037426","https://openalex.org/W3092518081"],"abstract_inverted_index":{"We":[0],"consider":[1],"stochastic":[2,42,55],"non-convex":[3,8],"optimization":[4,56,86,158],"problem":[5],"subject":[6],"to":[7,94,104,132,154,173],"deterministic":[9],"constraints.":[10],"The":[11],"proposed":[12,36,68],"algorithm":[13,37,69,151],"hinges":[14],"on":[15],"successive":[16],"convex":[17,72,85],"approximation":[18],"(SCA)":[19],"techniques":[20],"and":[21,58,77,81,102,108,137,166],"utilizes":[22],"recursive":[23,89],"momentum-based":[24],"acceleration":[25],"which":[26],"is":[27,92,118,152,171],"widely":[28],"used":[29],"in":[30],"the":[31,35,40,60,67,75,78,83,96,99,116,124,134,141,150,163,169,176],"unconstrained":[32],"settings.":[33],"Remarkably,":[34],"also":[38],"achieves":[39],"optimal":[41],"first":[43],"order":[44],"(SFO)":[45],"complexity,":[46],"at":[47],"par":[48],"with":[49],"that":[50,129,140,168,174],"achieved":[51],"by":[52],"state-of-the-art":[53],"(unconstrained)":[54],"algorithms,":[57],"matches":[59],"SFO-complexity":[61],"lower":[62],"bound.":[63],"At":[64],"each":[65],"iteration,":[66],"entails":[70],"constructing":[71],"surrogates":[73],"of":[74,98,115,123,175],"objective":[76,100],"constraint":[79],"functions,":[80],"solving":[82],"resulting":[84],"problem.":[87,159],"A":[88,112],"update":[90],"rule":[91],"employed":[93],"track":[95],"gradient":[97],"function,":[101],"contributes":[103],"achieving":[105],"faster":[106],"convergence":[107],"improved":[109],"SFO":[110],"complexity.":[111],"key":[113],"ingredient":[114],"proof":[117],"a":[119],"new":[120],"parameterized":[121],"version":[122],"standard":[125],"Mangasarian-Fromowitz":[126],"Constraints":[127],"Qualification,":[128],"allows":[130],"us":[131],"bound":[133],"dual":[135],"variables":[136],"hence":[138],"establish":[139],"iterates":[142],"approach":[143],"an":[144,155],"<tex":[145],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[146],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\epsilon$</tex>-stationary":[147],"point.":[148],"Finally,":[149],"applied":[153],"obstacle-avoiding":[156],"trajectory":[157],"Numerical":[160],"results":[161],"confirm":[162],"theoretical":[164],"claims":[165],"illustrate":[167],"performance":[170],"superior":[172],"existing":[177],"SCA":[178],"algorithms.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":4}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}