- Category:
- Algorithm
- Tags:
-
- File Size:
- 12kb
- Update:
- 2017-12-01
- Downloads:
- 0 Times
- Uploaded by:
- 潘铭敏
Description: Sequential two times programming (SQP) is considered to be one of the most effective ways to solve nonlinear constrained optimization. The traditional SQP algorithm requires QP iteration for every iteration.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| SQP方法
|
| SQP方法\lagsqp.asv | 4153 | 2009-11-16
|
| SQP方法\lagsqp.m | 4171 | 2009-11-16
|
| SQP方法\newtlagr.asv | 3659 | 2009-11-14
|
| SQP方法\newtlagr.m | 3691 | 2009-11-16
|
| SQP方法\qpsubp.asv | 4608 | 2009-12-31
|
| SQP方法\qpsubp.m | 4608 | 2009-12-31
|
| SQP方法\sqpm.asv | 4271 | 2009-11-24
|
| SQP方法\sqpm.m | 4273 | 2009-12-31 |
Download