Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010)
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: Generalized monotone line search SQP algorithm for constrained minimax problems |
scientific article; zbMATH DE number 5546181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized monotone line search SQP algorithm for constrained minimax problems |
scientific article; zbMATH DE number 5546181 |
Statements
Generalized monotone line search SQP algorithm for constrained minimax problems (English)
0 references
23 April 2009
0 references
constrained minimax problems
0 references
generalized monotone line search
0 references
SQP algorithm
0 references
global convergence
0 references
superlinear convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9575586
0 references
0.92465043
0 references
0.92145324
0 references
0.9136175
0 references
0.91168004
0 references
0.90867823
0 references
0.8972309
0 references
0.8945549
0 references
0.89325345
0 references
