Minimax and Applications: 4 (Nonconvex Optimization and Its Applications, 4) - Hardcover

 
9780792336150: Minimax and Applications: 4 (Nonconvex Optimization and Its Applications, 4)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Review

` ... 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)

Synopsis

Classical minimax theory (von Neumann), duality and saddle point analysis have together played a critical role in optimization and game theory. It is currently recognized that minimax problems and techniques appear throughout a broad spectrum of disciplines, including game theory, optimization, and computational complexity. Many interesting and sophisticated problems are formulated as minimax applications, as in the fields of combinatorial optimization, scheduling, location, packing, searching, and triangulation. The contributions to "Minimax and Applications" cover a wide range of topics and provide an excellent picture of recent research and developments in minimax theory. Audience: Accessible to graduate students as well as researchers in optimization, computer science, and related areas.

"About this title" may belong to another edition of this title.

Other Popular Editions of the Same Title

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

Featured Edition

ISBN 10:  1461335590 ISBN 13:  9781461335597
Publisher: Springer, 2011
Softcover