{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T01:54:24Z","timestamp":1776131664673,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T00:00:00Z","timestamp":1656547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T00:00:00Z","timestamp":1656547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research","award":["DE-AC02-06CH11347"],"award-info":[{"award-number":["DE-AC02-06CH11347"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1545046"],"award-info":[{"award-number":["CNS-1545046"]}],"id":[{"id":"10.13039\/100000001","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,5]]},"DOI":"10.1007\/s10107-022-01846-z","type":"journal-article","created":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T16:21:45Z","timestamp":1656606105000},"page":"721-791","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians"],"prefix":"10.1007","volume":"199","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7977-5276","authenticated-orcid":false,"given":"Sen","family":"Na","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Anitescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mladen","family":"Kolar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,30]]},"reference":[{"issue":"3","key":"1846_CR1","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1137\/130915984","volume":"24","author":"AS Bandeira","year":"2014","unstructured":"Bandeira, A.S., Scheinberg, K., Vicente, L.N.: Convergence of trust-region methods based on probabilistic models. SIAM Journal on Optimization 24(3), 1238\u20131264 (2014). https:\/\/doi.org\/10.1137\/130915984","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"1846_CR2","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1080\/10556788.2020.1725751","volume":"35","author":"AS Berahas","year":"2020","unstructured":"Berahas, A.S., Bollapragada, R., Nocedal, J.: An investigation of newton-sketch and subsampled newton methods. Optimization Methods and Software 35(4), 661\u2013680 (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1725751","journal-title":"Optimization Methods and Software"},{"issue":"2","key":"1846_CR3","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., Zhou, B.: Sequential quadratic optimization for nonlinear equality constrained stochastic optimization. SIAM J. Optim. 31(2), 1352\u20131379 (2021). https:\/\/doi.org\/10.1137\/20m1354556","journal-title":"SIAM J. Optim."},{"key":"1846_CR4","doi-asserted-by":"publisher","unstructured":"Bertsekas, D.: Constrained Optimization and Lagrange Multiplier Methods. Elsevier, Belmont, Mass, (1982). https:\/\/doi.org\/10.1016\/c2013-0-10366-2","DOI":"10.1016\/c2013-0-10366-2"},{"issue":"2","key":"1846_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Projected newton methods for optimization problems with simple constraints. SIAM J. Control. Optim. 20(2), 221\u2013246 (1982). https:\/\/doi.org\/10.1137\/0320018","journal-title":"SIAM J. Control. Optim."},{"issue":"2","key":"1846_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/ijoo.2019.0016","volume":"1","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Cartis, C., Menickelly, M., Scheinberg, K.: Convergence rate analysis of a stochastic trust-region method via supermartingales. INFORMS Journal on Optimization 1(2), 92\u2013119 (2019). https:\/\/doi.org\/10.1287\/ijoo.2019.0016","journal-title":"INFORMS Journal on Optimization"},{"issue":"4","key":"1846_CR7","doi-asserted-by":"publisher","first-page":"3312","DOI":"10.1137\/17m1154679","volume":"28","author":"R Bollapragada","year":"2018","unstructured":"Bollapragada, R., Byrd, R., Nocedal, J.: Adaptive sampling strategies for stochastic optimization. SIAM J. Optim. 28(4), 3312\u20133343 (2018). https:\/\/doi.org\/10.1137\/17m1154679","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1846_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1093\/imanum\/dry009","volume":"39","author":"R Bollapragada","year":"2018","unstructured":"Bollapragada, R., Byrd, R.H., Nocedal, J.: Exact and inexact subsampled newton methods for optimization. IMA J. Numer. Anal. 39(2), 545\u2013578 (2018). https:\/\/doi.org\/10.1093\/imanum\/dry009","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"1846_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16m1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018). https:\/\/doi.org\/10.1137\/16m1080173","journal-title":"SIAM Rev."},{"issue":"1","key":"1846_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-012-0572-5","volume":"134","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Wu, Y.: Sample size selection in optimization methods for machine learning. Math. Program. 134(1), 127\u2013155 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0572-5","journal-title":"Math. Program."},{"issue":"2","key":"1846_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2017","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169(2), 337\u2013375 (2017). https:\/\/doi.org\/10.1007\/s10107-017-1137-4","journal-title":"Math. Program."},{"issue":"2","key":"1846_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10107-017-1141-8","volume":"169","author":"R Chen","year":"2017","unstructured":"Chen, R., Menickelly, M., Scheinberg, K.: Stochastic optimization using a trust-region method and random models. Math. Program. 169(2), 447\u2013487 (2017). https:\/\/doi.org\/10.1007\/s10107-017-1141-8","journal-title":"Math. Program."},{"key":"1846_CR13","doi-asserted-by":"publisher","unstructured":"Curtis, F.E., Shi, R.: A fully stochastic second-order trust region method. Optimization Methods and Software 1\u201334, (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1852403","DOI":"10.1080\/10556788.2020.1852403"},{"issue":"3","key":"1846_CR14","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/ijoo.2018.0010","volume":"1","author":"FE Curtis","year":"2019","unstructured":"Curtis, F.E., Scheinberg, K., Shi, R.: A stochastic trust region algorithm based on careful step normalization. INFORMS Journal on Optimization 1(3), 200\u2013220 (2019). https:\/\/doi.org\/10.1287\/ijoo.2018.0010","journal-title":"INFORMS Journal on Optimization"},{"key":"1846_CR15","unstructured":"De, S., Yadav, A., Jacobs, D., Goldstein, T.: Automated Inference with Adaptive Batches. PMLR, Fort Lauderdale, FL, USA, Proceedings of Machine Learning Research, 54, 1504\u20131513 (2017). URL http:\/\/proceedings.mlr.press\/v54\/de17a.html"},{"issue":"4","key":"1846_CR16","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1214\/aos\/1176351052","volume":"16","author":"J Dupacova","year":"1988","unstructured":"Dupacova, J., Wets, R.: Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems. Ann. Stat. 16(4), 1517\u20131549 (1988). https:\/\/doi.org\/10.1214\/aos\/1176351052","journal-title":"Ann. Stat."},{"key":"1846_CR17","doi-asserted-by":"publisher","unstructured":"Durrett, R.: Probability, vol 49. Cambridge University Press (2019). https:\/\/doi.org\/10.1017\/9781108591034","DOI":"10.1017\/9781108591034"},{"issue":"3","key":"1846_CR18","doi-asserted-by":"publisher","first-page":"A1380","DOI":"10.1137\/110830629","volume":"34","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Schmidt, M.: Hybrid deterministic-stochastic methods for data fitting. SIAM J. Sci. Comput. 34(3), A1380\u2013A1405 (2012). https:\/\/doi.org\/10.1137\/110830629","journal-title":"SIAM J. Sci. Comput."},{"key":"1846_CR19","doi-asserted-by":"publisher","unstructured":"Gallager, R.G.: Stochastic Processes. Cambridge University Press (2013). https:\/\/doi.org\/10.1017\/cbo9781139626514","DOI":"10.1017\/cbo9781139626514"},{"key":"1846_CR20","doi-asserted-by":"publisher","unstructured":"Gill, P.E., Wong, E.: Sequential quadratic programming methods. In: Mixed Integer Nonlinear Programming, IMA Vol. Math. Appl., vol 154, Springer New York, 147\u2013224 (2011). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_6","DOI":"10.1007\/978-1-4614-1927-3_6"},{"issue":"1","key":"1846_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/s0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005). https:\/\/doi.org\/10.1137\/s0036144504446096","journal-title":"SIAM Rev."},{"issue":"3","key":"1846_CR22","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2014","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1846_CR23","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1093\/imanum\/drx043","volume":"38","author":"S Gratton","year":"2017","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Complexity and global rates of trust-region methods based on probabilistic models. IMA J. Numer. Anal. 38(3), 1579\u20131597 (2017). https:\/\/doi.org\/10.1093\/imanum\/drx043","journal-title":"IMA J. Numer. Anal."},{"key":"1846_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cam.2012.12.020","volume":"245","author":"N Kreji\u0107","year":"2013","unstructured":"Kreji\u0107, N., Krklec, N.: Line search methods with variable sample size for unconstrained optimization. J. Comput. Appl. Math. 245, 213\u2013231 (2013). https:\/\/doi.org\/10.1016\/j.cam.2012.12.020","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1846_CR25","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/bf00940474","volume":"67","author":"S Lucidi","year":"1990","unstructured":"Lucidi, S.: Recursive quadratic programming algorithm that uses an exact augmented lagrangian function. J. Optim. Theory Appl. 67(2), 227\u2013245 (1990). https:\/\/doi.org\/10.1007\/bf00940474","journal-title":"J. Optim. Theory Appl."},{"key":"1846_CR26","unstructured":"Maratos, N.: Exact penalty function algorithms for finite dimensional and control optimization problems. Doctoral dissertation (1978). URL http:\/\/hdl.handle.net\/10044\/1\/7283"},{"issue":"3","key":"1846_CR27","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1214\/aos\/1176348242","volume":"19","author":"NK Nagaraj","year":"1991","unstructured":"Nagaraj, N.K., Fuller, W.A.: Estimation of the parameters of linear time series models subject to nonlinear restrictions. Ann. Stat. 19(3), 1143\u20131154 (1991). https:\/\/doi.org\/10.1214\/aos\/1176348242","journal-title":"Ann. Stat."},{"key":"1846_CR28","unstructured":"Nandwani, Y., Pathak, A., Mausam, Singla, P.: A primal dual formulation for deep learning with constraints. In: Advances in Neural Information Processing Systems 32, Curran Associates, Inc., 12157\u201312168 (2019). URL http:\/\/papers.nips.cc\/paper\/9385-a-primal-dual-formulation-for-deep-learning-with-constraints.pdf"},{"issue":"4","key":"1846_CR29","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(4), 1574\u20131609 (2009). https:\/\/doi.org\/10.1137\/070704277","journal-title":"SIAM J. Optim."},{"key":"1846_CR30","doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer Series in Operations Research and Financial Engineering, Springer New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","DOI":"10.1007\/978-0-387-40065-5"},{"issue":"1","key":"1846_CR31","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/18m1216250","volume":"30","author":"C Paquette","year":"2020","unstructured":"Paquette, C., Scheinberg, K.: A stochastic line search method with expected complexity analysis. SIAM J. Optim. 30(1), 349\u2013376 (2020). https:\/\/doi.org\/10.1137\/18m1216250","journal-title":"SIAM J. Optim."},{"key":"1846_CR32","doi-asserted-by":"publisher","unstructured":"Pillo, G.: Exact penalty methods. In: Algorithms for Continuous Optimization, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., vol 434, Springer Netherlands, 209\u2013253 (1994). https:\/\/doi.org\/10.1007\/978-94-009-0369-2_8","DOI":"10.1007\/978-94-009-0369-2_8"},{"issue":"5","key":"1846_CR33","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1137\/0317044","volume":"17","author":"GD Pillo","year":"1979","unstructured":"Pillo, G.D., Grippo, L.: A new class of augmented lagrangians in nonlinear programming. SIAM J. Control. Optim. 17(5), 618\u2013628 (1979). https:\/\/doi.org\/10.1137\/0317044","journal-title":"SIAM J. Control. Optim."},{"key":"1846_CR34","doi-asserted-by":"publisher","unstructured":"Pillo, G.D., Grippo, L., Lampariello, F.: A method for solving equality constrained optimization problems by unconstrained minimization. In: Optimization Techniques, Springer-Verlag, Lecture Notes in Control and Information Sci. 23, 96\u2013105 (1980). https:\/\/doi.org\/10.1007\/bfb0006592","DOI":"10.1007\/bfb0006592"},{"issue":"1","key":"1846_CR35","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/bf01584661","volume":"4","author":"A Pr\u00e9kopa","year":"1973","unstructured":"Pr\u00e9kopa, A.: Contributions to the theory of stochastic programming. Math. Program. 4(1), 202\u2013221 (1973). https:\/\/doi.org\/10.1007\/bf01584661","journal-title":"Math. Program."},{"key":"1846_CR36","doi-asserted-by":"publisher","unstructured":"Ravi, S.N., Dinh, T., Lokhande, V.S., Singh, V.: Explicitly imposing constraints in deep networks via conditional gradients gives improved generalization and faster convergence. In: Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI), vol\u00a033, 4772\u20134779 (2019), https:\/\/doi.org\/10.1609\/aaai.v33i01.33014772","DOI":"10.1609\/aaai.v33i01.33014772"},{"issue":"1\u20132","key":"1846_CR37","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-018-1346-5","volume":"174","author":"F Roosta-Khorasani","year":"2018","unstructured":"Roosta-Khorasani, F., Mahoney, M.W.: Sub-sampled newton methods. Math. Program. 174(1\u20132), 293\u2013326 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1346-5","journal-title":"Math. Program."},{"key":"1846_CR38","unstructured":"di\u00a0Serafino, D., Kreji\u0107, N., Jerinki\u0107, N.K., Viola, M.: Lsos: Line-search second-order stochastic optimization methods. (2020) arXiv preprint arXiv:2007.15966"},{"issue":"3","key":"1846_CR39","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1214\/aos\/1015952006","volume":"28","author":"A Shapiro","year":"2000","unstructured":"Shapiro, A.: On the asymptotics of constrained local $m$-estimators. Ann. Stat. 28(3), 948\u2013960 (2000). https:\/\/doi.org\/10.1214\/aos\/1015952006","journal-title":"Ann. Stat."},{"key":"1846_CR40","doi-asserted-by":"publisher","unstructured":"Siqueira, A.S., Orban, D.: Cutest.jl. (2020) https:\/\/github.com\/JuliaSmoothOptimizers\/CUTEst.jl, https:\/\/doi.org\/10.5281\/ZENODO.1188851","DOI":"10.5281\/ZENODO.1188851"},{"key":"1846_CR41","doi-asserted-by":"publisher","unstructured":"Tripuraneni, N., Stern, M., Jin, C., Regier, J., Jordan, M.I.: Stochastic cubic regularization for fast nonconvex optimization. In: Advances in neural information processing systems, 2899\u20132908 (2018). https:\/\/doi.org\/10.5555\/3327144.3327213","DOI":"10.5555\/3327144.3327213"},{"issue":"4","key":"1846_CR42","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2011","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12(4), 389\u2013434 (2011). https:\/\/doi.org\/10.1007\/s10208-011-9099-z","journal-title":"Found. Comput. Math."},{"key":"1846_CR43","doi-asserted-by":"publisher","unstructured":"Tropp, J.A.: An introduction to matrix concentration inequalities. Foundations and Trends\u00ae in Machine Learning 8(1-2), 1\u2013230 (2015). https:\/\/doi.org\/10.1561\/2200000048","DOI":"10.1561\/2200000048"},{"issue":"2","key":"1846_CR44","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/15m1053141","volume":"27","author":"X Wang","year":"2017","unstructured":"Wang, X., Ma, S., Goldfarb, D., Liu, W.: Stochastic quasi-newton methods for nonconvex stochastic optimization. SIAM J. Optim. 27(2), 927\u2013956 (2017). https:\/\/doi.org\/10.1137\/15m1053141","journal-title":"SIAM J. Optim."},{"key":"1846_CR45","doi-asserted-by":"publisher","unstructured":"Wets, R.: Stochastic programming: Solution techniques and approximation schemes. In: Mathematical Programming The State of the Art, Springer Berlin Heidelberg, 566\u2013603 (1983). https:\/\/doi.org\/10.1007\/978-3-642-68874-4_22","DOI":"10.1007\/978-3-642-68874-4_22"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01846-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01846-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01846-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T17:35:30Z","timestamp":1682098530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01846-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,30]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1846"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01846-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,30]]},"assertion":[{"value":"11 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}