Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052)
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: Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems |
scientific article; zbMATH DE number 6379734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems |
scientific article; zbMATH DE number 6379734 |
Statements
Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (English)
0 references
12 December 2014
0 references
constrained minimax problems
0 references
SQP method
0 references
active set identification
0 references
line search
0 references
superlinear convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8812422156333923
0 references
0.8676915764808655
0 references
0.8442501425743103
0 references
0.8418639898300171
0 references
0.833369255065918
0 references
