{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T16:02:13Z","timestamp":1775318533103,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1909298"],"award-info":[{"award-number":["1909298"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10107-021-01742-y","type":"journal-article","created":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:04:01Z","timestamp":1642723441000},"page":"215-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Stochastic first-order methods for convex and nonconvex functional constrained optimization"],"prefix":"10.1007","volume":"197","author":[{"given":"Digvijay","family":"Boob","sequence":"first","affiliation":[]},{"given":"Qi","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Guanghui","family":"Lan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,21]]},"reference":[{"key":"1742_CR1","unstructured":"Allen-Zhu, Z., Hazan, E.: Variance reduction for faster non-convex optimization. In: International Conference on Machine Learning, pp. 699\u2013707 (2016)"},{"issue":"5","key":"1742_CR2","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/02331930903578700","volume":"60","author":"R Andreani","year":"2011","unstructured":"Andreani, R., Haeser, G., Mart\u00ednez, J.M.: On sequential optimality conditions for smooth constrained optimization. Optimization 60(5), 627\u2013641 (2011)","journal-title":"Optimization"},{"key":"1742_CR3","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/moor.2017.0879","volume":"43","author":"R Andreani","year":"2018","unstructured":"Andreani, R., Mart\u00ednez, J.M., Ramos, A., Silva, P.J.S.: Strict constraint qualifications and sequential optimality conditions for constrained optimization. Math. Oper. Res. 43, 693\u2013717 (2018)","journal-title":"Math. Oper. Res."},{"key":"1742_CR4","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-018-1351-8","volume":"174","author":"AY Aravkin","year":"2018","unstructured":"Aravkin, A.Y., Burke, J.V., Drusvyatskiy, D., Friedlander, M.P., Roy, S.: Level-set methods for convex optimization. Math. Program. 174, 359\u2013390 (2018)","journal-title":"Math. Program."},{"key":"1742_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10107-004-0553-4","volume":"102","author":"A Ben-Tal","year":"2005","unstructured":"Ben-Tal, A., Nemirovski, A.: Non-Euclidean restricted memory level method for large-scale convex optimization. Math. Program. 102, 407\u2013456 (2005)","journal-title":"Math. Program."},{"key":"1742_CR6","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"1742_CR7","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex Optimization Algorithms. Athena Scientific, Belmont (2015)"},{"issue":"1","key":"1742_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10107-012-0617-9","volume":"144","author":"C Cartis","year":"2014","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144(1), 93\u2013106 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1742_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"4","key":"1742_CR10","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"1742_CR11","unstructured":"Davis, D., Grimmer, B.: Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems. arXiv:1707.03505v4 (2017)"},{"key":"1742_CR12","unstructured":"Dinh, Q.T., Gumussoy, S., Michiels, W., Diehl, M.: Combining convex-concave decompositions and linearization approaches for solving BMIS, with application to static output feedback. arXiv:1109.3320 (2011)"},{"key":"1742_CR13","unstructured":"Facchinei, F., Kungurtsev, V., Lampariello, L., Scutari, G.: Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity. arXiv:1709.03384 (2017)"},{"key":"1742_CR14","unstructured":"Fang, C., Li, C.J., Lin, Z., Zhang, T.: Spider: Near-optimal non- convex optimization via stochastic path-integrated differential estimator. Adv. Neural Inf. Process. Syst. 687\u2013697 (2018)"},{"key":"1742_CR15","unstructured":"Frostig, R., Ge, R., Kakade, S., Sidford, A.: Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization. In: International Conference on Machine Learning, pp.\u00a02540\u20132548 (2015)"},{"issue":"4","key":"1742_CR16","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1742_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1\u20132), 59\u201399 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1742_CR18","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/0802032","volume":"2","author":"O G\u00fcler","year":"1992","unstructured":"G\u00fcler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2(4), 649\u2013664 (1992)","journal-title":"SIAM J. Optim."},{"key":"1742_CR19","unstructured":"Hamedani, E.Y., Aybat, N.S.: A primal-dual algorithm for general convex-concave saddle point problems. arXiv:1803.01401 (2018)"},{"key":"1742_CR20","doi-asserted-by":"crossref","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.: Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. arXiv:1802.03504 (2018)","DOI":"10.1137\/18M1171011"},{"key":"1742_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-order and Stochastic Optimization Methods for Machine Learning","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-order and Stochastic Optimization Methods for Machine Learning. Springer, Berlin (2020)"},{"key":"1742_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-018-1355-4","volume":"180","author":"G Lan","year":"2018","unstructured":"Lan, G., Lee, S., Zhou, Y.: Communication-efficient algorithms for decentralized and stochastic optimization. Math. Program. 180, 237\u2013284 (2018)","journal-title":"Math. Program."},{"key":"1742_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138, 115\u2013139 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1742_CR24","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10107-015-0861-x","volume":"155","author":"G Lan","year":"2016","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order augmented Lagrangian methods for convex programming. Math. Program. 155(1\u20132), 511\u2013547 (2016)","journal-title":"Math. Program."},{"key":"1742_CR25","unstructured":"Lan, G., Yang, Y.: Accelerated stochastic algorithms for nonconvex finite-sum and multi-block optimization. arXiv:1805.05411 (2018)"},{"issue":"1\u20132","key":"1742_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-017-1173-0","volume":"171","author":"G Lan","year":"2018","unstructured":"Lan, G., Zhou, Y.: An optimal randomized incremental gradient method. Math. Program. 171(1\u20132), 167\u2013215 (2018)","journal-title":"Math. Program."},{"key":"1742_CR27","unstructured":"Lan, G., Zhou, Z.: Algorithms for stochastic optimization with expectation constraints. arXiv:1604.03887 (2016)"},{"key":"1742_CR28","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovski, A.S., Nesterov, Y.E.: New variants of bundle methods. Math. Program. 69, 111\u2013148 (1995)","journal-title":"Math. Program."},{"key":"1742_CR29","unstructured":"Lin, Q., Ma, R., Yang, T.: Level-set methods for finite-sum constrained convex optimization. In: Proceedings of the 35th International Conference on Machine Learning, vol.\u00a080, pp.\u00a03112\u20133121 (2018)"},{"issue":"4","key":"1742_CR30","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1137\/17M1152334","volume":"28","author":"Q Lin","year":"2018","unstructured":"Lin, Q., Nadarajah, S., Soheili, N.: A level-set method for convex optimization with a feasible solution path. SIAM J. Optim. 28(4), 3290\u20133311 (2018)","journal-title":"SIAM J. Optim."},{"key":"1742_CR31","unstructured":"Ma, R., Lin, Q., Yang, T.: Proximally constrained methods for weakly convex optimization with weakly convex constraints. arXiv:1908.01871 (2019)"},{"key":"1742_CR32","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-247X(67)90163-1","volume":"17","author":"O Mangasarian","year":"1967","unstructured":"Mangasarian, O., Fromovitz, S.: The fritz john necessary optimality conditions in the presence of equality and inequality constraints. J. Math. Anal. Appl. 17, 37\u201347 (1967)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"1742_CR33","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1024791525441","volume":"118","author":"JM Mart\u00ednez","year":"2003","unstructured":"Mart\u00ednez, J.M., Svaiter, B.F.: A practical optimality condition without constraint qualifications for nonlinear programming. J. Optim. Theory Appl. 118(1), 117\u2013133 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1742_CR34","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence o(1\/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"1742_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer, Berlin (2018)"},{"key":"1742_CR36","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., c, M.T.: A novel method for machine learning problems using stochastic recursive gradient. In: Proceedings of the 34th International Conference on Machine Learning, vol. 70, pp. 2613\u20132621 (2017)"},{"key":"1742_CR37","unstructured":"Nouiehed, M., Sanjabi, M., Lee, J.D., Razaviyayn, M.: Solving a class of non-convex min-max games using iterative first order methods. arXiv:1902.08297 (2019)"},{"key":"1742_CR38","unstructured":"Pham, N.H., Nguyen, L.M., Phan, D.T., Tran-Dinh, Q.: Proxsarah: an efficient algorithmic framework for stochastic composite nonconvex optimization. arXiv:1902.05679 (2019)"},{"issue":"3","key":"1742_CR39","first-page":"593","volume":"8","author":"B Polyak","year":"1967","unstructured":"Polyak, B.: A general method of solving extremum problems. Sov. Math. Doklady 8(3), 593\u2013597 (1967)","journal-title":"Sov. Math. Doklady"},{"key":"1742_CR40","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Non-convex min-max optimization: provable algorithms and applications in machine learning. arXiv:1810.02060 (2018)"},{"key":"1742_CR41","doi-asserted-by":"crossref","unstructured":"Reddi, S.J., Hefny, A., Sra, S., P\u00f3cz\u00f3s, B., Smola, A.J.: Stochastic variance reduction for nonconvex optimization. In: International Conference on Machine Learning, pp. 314\u2013323 (2016)","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"1742_CR42","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201341 (2000)","journal-title":"J. Risk"},{"key":"1742_CR43","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on Stochastic Programming: Modeling and Theory, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2014)"},{"issue":"306","key":"1742_CR44","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1090\/mcom\/3178","volume":"86","author":"X Wang","year":"2017","unstructured":"Wang, X., Ma, S., Yuan, Y.: Penalty methods with stochastic approximation for stochastic nonlinear programming. Math. Comput. 86(306), 1793\u20131820 (2017)","journal-title":"Math. Comput."},{"key":"1742_CR45","unstructured":"Wang, Z., Ji, K., Zhou, Y., Liang, Y., Tarokh, V.: Spiderboost: A class of faster variance-reduced algorithms for nonconvex optimization. arXiv:1810.10690 (2018)"},{"key":"1742_CR46","doi-asserted-by":"crossref","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. (2019)","DOI":"10.1007\/s10107-019-01425-9"},{"key":"1742_CR47","unstructured":"Yu, H., Neely, M., Wei, X.: Online convex optimization with stochastic constraints. Adv. Neural Inf. Process. Syst. pp. 1428\u20131438 (2017)"},{"key":"1742_CR48","unstructured":"Zhou, D., Xu, P., Gu, Q.: Stochastic nested variance reduction for nonconvex optimization. In Proceedings of the 32nd International Conference on Neural Information Processing Systems (USA, 2018), NIPS\u201918, Curran Associates Inc., pp. 3925\u20133936"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01742-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01742-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01742-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T01:07:14Z","timestamp":1674349634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01742-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,21]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1742"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01742-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,21]]},"assertion":[{"value":"5 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}