{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T18:59:59Z","timestamp":1732042799733},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2030859","CCF-2008484"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-21-1-2532","N00014-21-1-2532"],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10107-023-01981-1","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T12:03:24Z","timestamp":1686139404000},"page":"431-483","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization"],"prefix":"10.1007","volume":"205","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-7214-9187","authenticated-orcid":false,"given":"Frank E.","family":"Curtis","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7369-4571","authenticated-orcid":false,"given":"Michael J.","family":"O\u2019Neill","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0251-4227","authenticated-orcid":false,"given":"Daniel P.","family":"Robinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"1981_CR1","doi-asserted-by":"crossref","unstructured":"Berahas, A.S., Curtis, F.E., O\u2019Neill, M.J., Robinson, D.P.: A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear Equality Constrained Optimization with Rank-Deficient Jacobians. arXiv:2106.13015 (2021)","DOI":"10.1137\/20M1354556"},{"key":"1981_CR2","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1137\/20M1354556","volume":"31","author":"AS Berahas","year":"2021","unstructured":"Berahas, A.S., Curtis, F.E., Robinson, D.P., Zhou, B.: Sequential quadratic optimization for nonlinear equality constrained stochastic optimization. SIAM J. Optim. 31, 1352\u20131379 (2021)","journal-title":"SIAM J. Optim."},{"key":"1981_CR3","unstructured":"Bertsekas, D.P.: Network optimization: continuous and discrete models, Athena Scientific Belmont (1998)"},{"key":"1981_CR4","doi-asserted-by":"crossref","unstructured":"Betts, J.T.: Practical methods for optimal control and estimation using nonlinear programming, SIAM (2010)","DOI":"10.1137\/1.9780898718577"},{"key":"1981_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-010-0408-0","volume":"133","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Lopez-Calva, G., Nocedal, J.: A line search exact penalty method using steering rules. Math. Program. 133, 39\u201373 (2012)","journal-title":"Math. Program."},{"key":"1981_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1080\/10556780701394169","volume":"23","author":"RH Byrd","year":"2008","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Steering exact penalty methods for nonlinear programming. Optim. Methods Softw. 23, 197\u2013213 (2008)","journal-title":"Optim. Methods Softw."},{"key":"1981_CR7","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1093\/imanum\/drr035","volume":"32","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J. Numer. Anal. 32, 1662\u20131695 (2012). https:\/\/doi.org\/10.1093\/imanum\/drr035","journal-title":"IMA J. Numer. Anal."},{"key":"1981_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.M., Toint, P.L.: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 144, 93\u2013106 (2014)","journal-title":"Math. Program."},{"key":"1981_CR9","doi-asserted-by":"crossref","unstructured":"Chen, C., Tung, F., Vedula, N., Mori, G.: Constraint-aware deep neural network compression. In Proceedings of the European Conference on Computer Vision (ECCV), pp.\u00a0400\u2013415 (2018)","DOI":"10.1007\/978-3-030-01237-3_25"},{"key":"1981_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s12532-012-0041-4","volume":"4","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E.: A penalty-interior-point algorithm for nonlinear constrained optimization. Math. Program. Comput. 4, 181\u2013209 (2012)","journal-title":"Math. Program. Comput."},{"key":"1981_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10107-014-0784-y","volume":"152","author":"FE Curtis","year":"2015","unstructured":"Curtis, F.E., Jiang, H., Robinson, D.P.: An adaptive augmented lagrangian method for large-scale constrained optimization. Math. Program. 152, 201\u2013245 (2015)","journal-title":"Math. Program."},{"key":"1981_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1335-8","volume":"176","author":"FE Curtis","year":"2019","unstructured":"Curtis, F.E., Robinson, D.P.: Exploiting negative curvature in deterministic and stochastic optimization. Math. Program. 176, 69\u201394 (2019)","journal-title":"Math. Program."},{"key":"1981_CR13","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1137\/16M1108650","volume":"28","author":"FE Curtis","year":"2018","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: Complexity analysis of a trust funnel algorithm for equality constrained optimization. SIAM J. Optim. 28, 1533\u20131563 (2018)","journal-title":"SIAM J. Optim."},{"key":"1981_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29, 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"key":"1981_CR15","doi-asserted-by":"crossref","unstructured":"Durrett, R.: Probability: Theory and Examples, vol.\u00a049, Cambridge University Press (2019)","DOI":"10.1017\/9781108591034"},{"key":"1981_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155, 267\u2013305 (2016)","journal-title":"Math. Program."},{"key":"1981_CR17","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1093\/imanum\/draa021","volume":"41","author":"GN Grapiglia","year":"2020","unstructured":"Grapiglia, G.N., Yuan, Y.-X.: On the complexity of an augmented Lagrangian method for nonconvex optimization. IMA J. Numer. Anal. 41, 1546\u20131568 (2020)","journal-title":"IMA J. Numer. Anal."},{"key":"1981_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01588250","volume":"17","author":"SP Han","year":"1979","unstructured":"Han, S.P., Mangasarian, O.L.: Exact penalty functions in nonlinear programming. Math. Program. 17, 251\u2013269 (1979). https:\/\/doi.org\/10.1007\/BF01588250","journal-title":"Math. Program."},{"key":"1981_CR19","unstructured":"Hazan, E., Luo, H.: Variance-reduced and projection-free stochastic optimization. In International Conference on Machine Learning, PMLR, pp.\u00a01263\u20131271 (2016)"},{"key":"1981_CR20","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00247656","volume":"1","author":"F Kupfer","year":"1992","unstructured":"Kupfer, F., Sachs, E.W.: Numerical solution of a nonlinear parabolic control problem by a reduced sqp method. Comput. Optim. Appl. 1, 113\u2013135 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"1981_CR21","unstructured":"Li, X., Orabona, F.: A high probability analysis of adaptive SGD with momentum. arXiv: 2007.14294 (2020)"},{"key":"1981_CR22","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/0377-2217(93)E0339-Y","volume":"83","author":"M Mongeau","year":"1995","unstructured":"Mongeau, M., Sartenaer, A.: Automatic decrease of the penalty parameter in exact penalty function methods. Eur. J. Oper. Res. 83, 686\u2013699 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"1981_CR23","doi-asserted-by":"crossref","unstructured":"Na, S., Anitescu, M., Kolar, M.: An Adaptive Stochastic Sequential Quadratic Programming with Differentiable Exact Augmented Lagrangians. arXiv preprint arXiv:2102.05320 (2021)","DOI":"10.1007\/s10107-022-01846-z"},{"key":"1981_CR24","unstructured":"Na, S., Mahoney, M.W.: Asymptotic convergence rate and statistical inference for stochastic sequential quadratic programming. arXiv:2205.13687 (2022)"},{"key":"1981_CR25","unstructured":"Nandwani, Y., Pathak, A., Mausam, P.: A primal dual formulation for deep learning with constraints, in NeurIPS, Singla (2019)"},{"key":"1981_CR26","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1981_CR27","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1137\/060649513","volume":"19","author":"J Nocedal","year":"2009","unstructured":"Nocedal, J., W\u00e4chter, A., Waltz, R.A.: Adaptive barrier update strategies for nonlinear interior methods. SIAM J. Optim. 19, 1674\u20131693 (2009)","journal-title":"SIAM J. Optim."},{"key":"1981_CR28","unstructured":"Nocedal, J., Wright, S.J.: Numerical optimization. Springer Science & Business Media (2006)"},{"key":"1981_CR29","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1137\/080727154","volume":"32","author":"T Rees","year":"2010","unstructured":"Rees, T., Dollar, H.S., Wathen, A.J.: Optimal solvers for pde-constrained optimization. SIAM J. Sci. Comput. 32, 271\u2013298 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1981_CR30","doi-asserted-by":"crossref","unstructured":"Roy, S.\u00a0K., Mhammedi, Z., Harandi, M.: Geometry aware constrained optimization techniques for deep learning. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.\u00a04460\u20134469 (2018)","DOI":"10.1109\/CVPR.2018.00469"},{"key":"1981_CR31","doi-asserted-by":"crossref","unstructured":"Stirzaker, D.: Elementary probability. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511755309"},{"key":"1981_CR32","unstructured":"Wilson, R.B.: A Simplicial Algorithm for Concave Programming, Ph.D. Dissertation, Graduate School of Business Administration (1963)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01981-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01981-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01981-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T14:13:13Z","timestamp":1712412793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01981-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1981"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01981-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"31 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}