A type of efficient feasible SQP algorithms for inequality constrained optimization (Q846474)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A type of efficient feasible SQP algorithms for inequality constrained optimization |
scientific article; zbMATH DE number 5668009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A type of efficient feasible SQP algorithms for inequality constrained optimization |
scientific article; zbMATH DE number 5668009 |
Statements
A type of efficient feasible SQP algorithms for inequality constrained optimization (English)
0 references
9 February 2010
0 references
inequality constrained optimization
0 references
global convergence
0 references
superlinear convergence
0 references
successive quadratic programming (SQP)
0 references
0 references
0 references
0 references
0 references
0 references
0.9818132
0 references
0.9610491
0 references
0 references
0.94329464
0 references
0.94309014
0 references
0.9423292
0 references
0 references
0.93311536
0 references
0.93274677
0 references
0.93232876
0 references
