+- HHWForum.hu (https://hhwforum.hu)
+-- Fórum: Letöltések (https://hhwforum.hu/forumdisplay.php?fid=9)
+--- Fórum: E-könyvek (https://hhwforum.hu/forumdisplay.php?fid=57)
+---- Fórum: Külföldi könyvek (https://hhwforum.hu/forumdisplay.php?fid=64)
+---- Téma: Minimax and Applications (/showthread.php?tid=343109)
RE: Minimax and Applications - book24h - 2025-08-03
![[Kép: c70e927432fd408efc1a51efc25523d3.webp]](https://i125.fastpic.org/big/2025/0803/d3/c70e927432fd408efc1a51efc25523d3.webp)
Free Download Minimax and Applications by Ding-Zhu Du, Panos M. Pardalos
English | PDF | 1995 | 300 Pages | ISBN : 0792336151 | 37.7 MB
Techniques and principles of minimax theory play a key role in many areas of research, including game theory, optimization, and computational complexity. In general, a minimax problem can be formulated as min max f(x, y) (1) ",EX !lEY where f(x, y) is a function defined on the product of X and Y spaces. There are two basic issues regarding minimax problems: The first issue concerns the establishment of sufficient and necessary conditions for equality minmaxf(x,y) = maxminf(x,y). (2) "'EX !lEY !lEY "'EX The classical minimax theorem of von Neumann is a result of this type. Duality theory in linear and convex quadratic programming interprets minimax theory in a different way. The second issue concerns the establishment of sufficient and necessary conditions for values of the variables x and y that achieve the global minimax function value f(x*, y*) = minmaxf(x, y). (3) "'EX !lEY There are two developments in minimax theory that we would like to mention.
xMinimax and Applications
![[Kép: 2dee99ee3a4982759864e26530547bd9.webp]](https://i125.fastpic.org/big/2025/0803/d9/2dee99ee3a4982759864e26530547bd9.webp)
Close
Minimax and Applications by Ding-Zhu Du, Panos M. Pardalos
English | PDF | 1995 | 300 Pages | ISBN : 0792336151 | 37.7 MB
Techniques and principles of minimax theory play a key role in many areas of research, including game theory, optimization, and computational complexity. In general, a minimax problem can be formulated as min max f(x, y) (1) ",EX !lEY where f(x, y) is a function defined on the product of X and Y spaces. There are two basic issues regarding minimax problems: The first issue concerns the establishment of sufficient and necessary conditions for equality minmaxf(x,y) = maxminf(x,y). (2) "'EX !lEY !lEY "'EX The classical minimax theorem of von Neumann is a result of this type. Duality theory in linear and convex quadratic programming interprets minimax theory in a different way. The second issue concerns the establishment of sufficient and necessary conditions for values of the variables x and y that achieve the global minimax function value f(x*, y*) = minmaxf(x, y). (3) "'EX !lEY There are two developments in minimax theory that we would like to mention.
[/b]
Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me
Idézet:A kódrészlet megtekintéséhez be kell jelentkezned, vagy nincs jogosultságod a tartalom megtekintéséhez.Links are Interchangeable - Single Extraction