A comparative study of several semi-infinite nonlinear programming algorithms (Q1102202)
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 comparative study of several semi-infinite nonlinear programming algorithms |
scientific article; zbMATH DE number 4049410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparative study of several semi-infinite nonlinear programming algorithms |
scientific article; zbMATH DE number 4049410 |
Statements
A comparative study of several semi-infinite nonlinear programming algorithms (English)
0 references
1988
0 references
computational comparison
0 references
semi-infinite nonlinear programming algorithms
0 references
global convergence
0 references
feasible direction
0 references
successive quadratic programming
0 references
Robustness
0 references
relative efficiency
0 references
0 references
0.9058101
0 references
0.9050946
0 references
0.9027848
0 references
0.9008918
0 references
0.89157397
0 references
