A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the prop...
Saved in:
| Published in: | SIAM journal on optimization Vol. 11; no. 4; pp. 1092 - 1118 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Philadelphia
Society for Industrial and Applied Mathematics
01.01.2001
|
| Subjects: | |
| ISSN: | 1052-6234, 1095-7189 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!