A hybrid algorithm for linearly constrained minimax problems (Q363595)
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: A hybrid algorithm for linearly constrained minimax problems |
scientific article; zbMATH DE number 6203955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid algorithm for linearly constrained minimax problems |
scientific article; zbMATH DE number 6203955 |
Statements
A hybrid algorithm for linearly constrained minimax problems (English)
0 references
3 September 2013
0 references
nonlinear programming
0 references
linearly constrained minimax problems
0 references
trust-region methods
0 references
hybrid technique
0 references
superlinear convergence
0 references
0.8813822865486145
0 references
0.8182759284973145
0 references
0.8072567582130432
0 references
0.8059685826301575
0 references
0.796746015548706
0 references
