The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, April 16 until 2:00 AM ET on Friday, April 17 due to maintenance. We apologize for the inconvenience.
Explore Research Products in the PAR It may take a few hours for recently added research products to appear in PAR search results.
Curtis, Frank E., O’Neill, Michael J., and Robinson, Daniel P. Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization. Retrieved from https://par.nsf.gov/biblio/10428485. Mathematical Programming . Web. doi:10.1007/s10107-023-01981-1.
Curtis, Frank E., O’Neill, Michael J., & Robinson, Daniel P. Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization. Mathematical Programming, (). Retrieved from https://par.nsf.gov/biblio/10428485. https://doi.org/10.1007/s10107-023-01981-1
@article{osti_10428485,
place = {Country unknown/Code not available},
title = {Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization},
url = {https://par.nsf.gov/biblio/10428485},
DOI = {10.1007/s10107-023-01981-1},
abstractNote = {},
journal = {Mathematical Programming},
author = {Curtis, Frank E. and O’Neill, Michael J. and Robinson, Daniel P.},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.