{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:29:43Z","timestamp":1777537783214,"version":"3.51.4"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,12]],"date-time":"2021-12-12T00:00:00Z","timestamp":1639267200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,12]],"date-time":"2021-12-12T00:00:00Z","timestamp":1639267200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,12]]},"DOI":"10.1109\/wsc52266.2021.9715404","type":"proceedings-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:38:43Z","timestamp":1645648723000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Inexact-Proximal Accelerated Gradient Method for Stochastic Nonconvex Constrained Optimization Problems"],"prefix":"10.1109","author":[{"given":"Morteza","family":"Boroun","sequence":"first","affiliation":[{"name":"Systems and Industrial Engineering University of Arizona,Tucson,AZ,USA,85721"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Afrooz","family":"Jalilzadeh","sequence":"additional","affiliation":[{"name":"Systems and Industrial Engineering University of Arizona,Tucson,AZ,USA,85721"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Algorithms for stochastic optimization with expectation constraints","author":"lan","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref11","first-page":"2170","article-title":"Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization","author":"li","year":"0","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref12","article-title":"Augmented lagrangian based first-order methods for convex and nonconvex programs: nonergodic convergence and iteration complexity","author":"li","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref13","article-title":"Inexact proximal-point penalty methods for constrained non-convex optimization","author":"lin","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.3390\/en10101538","article-title":"Demand-side energy management based on nonconvex optimization in smart grid","volume":"10","author":"ma","year":"2017","journal-title":"Energies"},{"key":"ref15","author":"nemirovski","year":"1983","journal-title":"Problem Complexity and Method Efficiency in Optimization"},{"key":"ref16","first-page":"1","article-title":"ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization","volume":"21","author":"pham","year":"2020","journal-title":"Journal of Machine Learning Research"},{"key":"ref17","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","author":"schmidt","year":"0","journal-title":"Proceedings of the 24th International Conference on Neural Information Processing Systems"},{"key":"ref18","article-title":"A primal-dual algorithmic framework for constrained convex minimization","author":"tran-dinh","year":"2014","journal-title":"ArXiv Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.02.069"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/18M1213488"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0846-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/18M1171011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9723-3"},{"key":"ref2","article-title":"Stochastic first-order methods for convex and nonconvex functional constrained optimization","author":"boob","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref1","article-title":"Optimal convergence for stochastic optimization with multiple expectation constraints","author":"basu","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/18M1192536"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01425-9"},{"key":"ref21","article-title":"On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization","author":"zhang","year":"2018","journal-title":"ArXiv Preprint"}],"event":{"name":"2021 Winter Simulation Conference (WSC)","location":"Phoenix, AZ, USA","start":{"date-parts":[[2021,12,12]]},"end":{"date-parts":[[2021,12,15]]}},"container-title":["2021 Winter Simulation Conference (WSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9715283\/9715284\/09715404.pdf?arnumber=9715404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T21:11:33Z","timestamp":1655154693000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9715404\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,12]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/wsc52266.2021.9715404","relation":{},"subject":[],"published":{"date-parts":[[2021,12,12]]}}}