Ellipsoid projection method in matrix games

DOI10.1080/02331939208843751MaRDI QIDQ4327881zbMATH OpenOpenAlexFDO

Authors 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

\(\varepsilon\)-optimal solutionconstrained convex minimizationellipsoid projection algorithmzero-sum matrix game

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 579344
• Geometrically convergent projection method in matrix games
• scientific article; zbMATH DE number 60256
• Numerical solution of special matrix games
• Iteration in a subspace for solving matrix games

Cites work

• An iterative method of solving a game
• scientific article; zbMATH DE number 3876916 (Why is no real title available?)
• scientific article; zbMATH DE number 3916055 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• Toeplitz type theorems for double sequences and their applications to some iterative process in zero-sum continuous games

Cited in

(4)

• Geometrically convergent projection method in matrix games
• scientific article; zbMATH DE number 60256 (Why is no real title available?)
• scientific article; zbMATH DE number 579344 (Why is no real title available?)
• Numerical solution of special matrix games

This page was built for publication: Ellipsoid projection method in matrix games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327881)