SQP
From DDL Wiki
(Difference between revisions)
Line 1: | Line 1: | ||
- | |||
SQP stands for Sequential Quadratic Programming. It is an nonliear programming (NLP) algorithm and able to genereate a search direction. SQP is developed based on the reduced gradient method and the second order approximation of the Lagrangian function. For more details, please go to [[Sequential quadratic programming]] page. | SQP stands for Sequential Quadratic Programming. It is an nonliear programming (NLP) algorithm and able to genereate a search direction. SQP is developed based on the reduced gradient method and the second order approximation of the Lagrangian function. For more details, please go to [[Sequential quadratic programming]] page. |
Revision as of 15:24, 20 November 2006
SQP stands for Sequential Quadratic Programming. It is an nonliear programming (NLP) algorithm and able to genereate a search direction. SQP is developed based on the reduced gradient method and the second order approximation of the Lagrangian function. For more details, please go to Sequential quadratic programming page.