A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function

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

Abstract

Based on an augmented Lagrangian line search function, a sequential quadratically constrained quadratic programming method is proposed for solving nonlinearly constrained optimization problems. Compared to quadratic programming solved in the traditional SQP methods, a convex quadratically constrained quadratic programming is solved here to obtain a search direction, and the Maratos effect does not occur without any other corrections. The "active set" strategy used in this subproblem can avoid recalculating the unnecessary gradients and (approximate) Hessian matrices of the constraints. Under certain assumptions, the proposed method is proved to be globally, superlinearly, and quadratically convergent. As an extension, general problems with inequality and equality constraints as well as nonmonotone line search are also considered. © 2007.

Cite

CITATION STYLE

APA

Tang, C. M., & Jian, J. B. (2008). A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function. Journal of Computational and Applied Mathematics, 220(1–2), 525–547. https://doi.org/10.1016/j.cam.2007.09.024

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