Minimax and Applications: 4 (Nonconvex Optimization and Its Applications) - Tapa dura

Du, Dingzhu

 
9780792336150: Minimax and Applications: 4 (Nonconvex Optimization and Its Applications)
Tapa dura
ISBN 10: 0792336151 ISBN 13: 9780792336150
Editorial: Springer, 1995

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Críticas

` ... a valuable book carefully written in a clear and concise fashion. The survey papers give coherent and inspiring accounts ... coverage of algorithmic and applied topics ... is impressive. Both graduate students and researchers in fields such as optimization, computer science, production management, operations research and related areas will find this book to be an excellent source for learning about both classic and more recent developments in minimax and its applications. The editors are to be commended for their work in gathering these papers together.'
Journal of Global Optimization, 11 (1997)

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
1995
Idioma
Inglés
ISBN 10 
0792336151
ISBN 13 
9780792336150
Encuadernación
Tapa dura
Número de páginas
312
Editor
Ding-Zhu Du Du, Pardalos P. M.
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9781461335597: Minimax and Applications: 4 (Nonconvex Optimization and Its Applications)

Edición Destacada

ISBN 10:  1461335590 ISBN 13:  9781461335597
Editorial: Springer, 2011
Tapa blanda