An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions (Q4884046)
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: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions |
scientific article; zbMATH DE number 898156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions |
scientific article; zbMATH DE number 898156 |
Statements
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions (English)
0 references
19 March 1997
0 references
semi-infinite programming
0 references
many constraints
0 references
discretization
0 references
local convergence
0 references
sequential quadratic programming
0 references
continuous minimax problems
0 references
SQP method
0 references
line search
0 references
global convergence
0 references
algorithms
0 references
0.8547056913375854
0 references
0.8427226543426514
0 references
0.8336265087127686
0 references
