Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939)
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: Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints |
scientific article; zbMATH DE number 5171656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints |
scientific article; zbMATH DE number 5171656 |
Statements
Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (English)
0 references
17 July 2007
0 references
inequality constraints
0 references
minimax problems
0 references
generalized monotone line search
0 references
feasible sqp algorithm
0 references
global convergence
0 references
superlinear convergence
0 references
0 references
0 references
0.9575586
0 references
0.91913426
0 references
0.9145788
0 references
0.9117289
0 references
0.9111748
0 references
0.9061519
0 references
0.90523416
0 references
0.90025616
0 references
