Method of outer approximations and adaptive approximations for a class of matrix games
DOI10.1007/S10957-016-0953-7zbMATH Open1350.49032OpenAlexW2397816281MaRDI QIDQ328448FDOQ328448
Akshay Madhan, Elijah Polak, Seung Ho Lee, Ismail Bustany
Publication date: 20 October 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0953-7
Recommendations
- scientific article; zbMATH DE number 30340
- scientific article
- Some matrix techniques in game theory
- Extended matrix norm method: applications to bimatrix games and convergence results
- An interior-point algorithm for matrix games
- On the metric approach in the theory of matrix games
- Methods for solving matrix games with cross-evaluated payoffs
- scientific article; zbMATH DE number 579344
- scientific article; zbMATH DE number 3625111
global optimizationreceding horizon controladaptive discretizationdiscrete min-max problemsmatrix gamesouter approximations
Applications of game theory (91A80) Numerical methods based on nonlinear programming (49M37) Optimality conditions for minimax problems (49K35) Discrete approximations in optimal control (49M25)
Cites Work
- Optimization. Algorithms and consistent approximations
- Runge-Kutta methods in optimal control and the transformed adjoint system
- Constrained model predictive control: Stability and optimality
- Title not available (Why is that?)
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- Global solution of semi-infinite programs
- Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration
- Asymptotic properties of minimax trees and game-searching procedures
- Euler discretization and inexact restoration for optimal control
- Best-first fixed-depth minimax algorithms
- A literature survey of benchmark functions for global optimisation problems
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- Precision Control for Generalized Pattern Search Algorithms with Adaptive Precision Function Evaluations
- Smoothing method for minimax problems
This page was built for publication: Method of outer approximations and adaptive approximations for a class of matrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328448)
