APA (7th ed.) Citation

Curtis, F. E., O’Neill, M. J., & Robinson, D. P. (2024). Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization. Mathematical programming, 205(1-2), 431-483. https://doi.org/10.1007/s10107-023-01981-1

Chicago Style (17th ed.) Citation

Curtis, Frank E., Michael J. O’Neill, and Daniel P. Robinson. "Worst-case Complexity of an SQP Method for Nonlinear Equality Constrained Stochastic Optimization." Mathematical Programming 205, no. 1-2 (2024): 431-483. https://doi.org/10.1007/s10107-023-01981-1.

MLA (9th ed.) Citation

Curtis, Frank E., et al. "Worst-case Complexity of an SQP Method for Nonlinear Equality Constrained Stochastic Optimization." Mathematical Programming, vol. 205, no. 1-2, 2024, pp. 431-483, https://doi.org/10.1007/s10107-023-01981-1.