Numerical Experience with Sequential Quadratic Programming Algorithms for Equality Constrained Nonlinear Programming

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Computational experience is given for a sequential quadratic programming algorithm when LaGrange multiplier estimates, Hessian approximations, and merit functions are varied to test for computational efficiency. Indications of areas for further research are given. © 1989, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Shanno, D. F., & Phua, K. H. (1989). Numerical Experience with Sequential Quadratic Programming Algorithms for Equality Constrained Nonlinear Programming. ACM Transactions on Mathematical Software (TOMS), 15(1), 49–63. https://doi.org/10.1145/62038.62040

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free