Ellipsoid projection method in matrix games

DOI10.1080/02331939208843751zbMath0817.90140OpenAlexW2119322393MaRDI QIDQ4327881

Andrzej Cegielski

Publication date: 27 March 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843751

zbMATH Keywords

constrained convex minimizationzero-sum matrix game\(\varepsilon\)-optimal solutionellipsoid projection algorithm

Mathematics Subject Classification ID

Convex programming (90C25) 2-person games (91A05)

Related Items

Geometrically convergent projection method in matrix games

Cites Work

• An iterative method of solving a game
• Toeplitz type theorems for double sequences and their applications to some iterative process in zero-sum continuous games
• Unnamed Item
• Unnamed Item
• Unnamed Item