A hybrid algorithm for linearly constrained minimax problems (Q363595): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C47 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6203955 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
nonlinear programming | |||
| Property / zbMATH Keywords: nonlinear programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
linearly constrained minimax problems | |||
| Property / zbMATH Keywords: linearly constrained minimax problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
trust-region methods | |||
| Property / zbMATH Keywords: trust-region methods / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hybrid technique | |||
| Property / zbMATH Keywords: hybrid technique / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
superlinear convergence | |||
| Property / zbMATH Keywords: superlinear convergence / rank | |||
Normal rank | |||
Revision as of 12:09, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid algorithm for linearly constrained minimax problems |
scientific article |
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
