A superlinearly convergent sequential quadratic programming algorithm for minimax problems (Q5490746)
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 superlinearly convergent sequential quadratic programming algorithm for minimax problems |
scientific article; zbMATH DE number 5060286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A superlinearly convergent sequential quadratic programming algorithm for minimax problems |
scientific article; zbMATH DE number 5060286 |
Statements
4 October 2006
0 references
minimax problem
0 references
SQP algorithm
0 references
global convergence
0 references
superlinear convergence rate
0 references
0.9144102334976196
0 references
0.9108388423919678
0 references
0.8994675874710083
0 references
