An improved SQP algorithm for solving minimax problems (Q1021864)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5563147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved SQP algorithm for solving minimax problems |
scientific article; zbMATH DE number 5563147 |
Statements
An improved SQP algorithm for solving minimax problems (English)
0 references
9 June 2009
0 references
minimax problem
0 references
SQP algorithm
0 references
global convergence
0 references
superlinear convergence rate
0 references
0 references
0.9108388423919678
0 references
0.898704469203949
0 references
0.8890036940574646
0 references
0.8889385461807251
0 references
0.8825526833534241
0 references
