| 书目名称 | Minimax and Applications | | 编辑 | Ding-Zhu Du,Panos M. Pardalos | | 视频video | | | 丛书名称 | Nonconvex Optimization and Its Applications | | 图书封面 |  | | 描述 | 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. | | 出版日期 | Book 19951st edition | | 关键词 | algorithms; Approximation; combinatorial optimization; complexity; computation; game theory; geometry; netw | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4613-3557-3 | | isbn_softcover | 978-1-4613-3559-7 | | isbn_ebook | 978-1-4613-3557-3Series ISSN 1571-568X | | issn_series | 1571-568X | | copyright | Kluwer Academic Publisher 1995 |
The information of publication is updating
|
|
发表于 2025-3-21 19:29:48
