An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487)
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: An efficient sequential quadratic programming algorithm for nonlinear programming |
scientific article; zbMATH DE number 2137464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient sequential quadratic programming algorithm for nonlinear programming |
scientific article; zbMATH DE number 2137464 |
Statements
An efficient sequential quadratic programming algorithm for nonlinear programming (English)
0 references
23 February 2005
0 references
Inequality constrained optimization
0 references
Method of feasible direction
0 references
SQP algorithm
0 references
Global convergence
0 references
Superlinear convergence rate
0 references
Sequential quadratic programming
0 references
Feasible directions
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8959570527076721
0 references
0.8627150058746338
0 references
0.8589244484901428
0 references
