Ellipsoid projection method in matrix games (Q4327881): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3342208 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Toeplitz type theorems for double sequences and their applications to some iterative process in zero-sum continuous games / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3691446 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An iterative method of solving a game / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5187067 / rank | |||
Normal rank | |||
Latest revision as of 11:27, 23 May 2024
scientific article; zbMATH DE number 737296
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ellipsoid projection method in matrix games |
scientific article; zbMATH DE number 737296 |
Statements
Ellipsoid projection method in matrix games (English)
0 references
27 March 1995
0 references
zero-sum matrix game
0 references
constrained convex minimization
0 references
ellipsoid projection algorithm
0 references
\(\varepsilon\)-optimal solution
0 references
