A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786)
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 5230090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new superlinearly convergent SQP algorithm for nonlinear minimax problems |
scientific article; zbMATH DE number 5230090 |
Statements
A new superlinearly convergent SQP algorithm for nonlinear minimax problems (English)
0 references
25 January 2008
0 references
minimax problems
0 references
SQP algorithm
0 references
global convergence
0 references
superlinear convergence
0 references
0 references
0 references
0.915489673614502
0 references
0.9144102334976196
0 references
0.9120994806289672
0 references
0.905666172504425
0 references
0.8996027708053589
0 references
