Robust Optimization
by A. Ben-Tal, L. El Ghaoui, A. Nemirovski
Publisher: Princeton University Press 2009
ISBN/ASIN: B0087I5CBO
Number of pages: 564
Description:
Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle such problems today without considering this powerful methodology. Written by the principal developers of robust optimization, and describing the main achievements of a decade of research, this is the first book to provide a comprehensive and up-to-date account of the subject.
Download or read it online for free here:
Read online
(online reading)
Similar books
Applied Mathematical Programming
by S. Bradley, A. Hax, T. Magnanti - Addison-Wesley
This book shows you how to model a wide array of problems. Covered are topics such as linear programming, duality theory, sensitivity analysis, network/dynamic programming, integer programming, non-linear programming, and my favorite, etc.
(19319 views)
by S. Bradley, A. Hax, T. Magnanti - Addison-Wesley
This book shows you how to model a wide array of problems. Covered are topics such as linear programming, duality theory, sensitivity analysis, network/dynamic programming, integer programming, non-linear programming, and my favorite, etc.
(19319 views)
The Design of Approximation Algorithms
by D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(15915 views)
by D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(15915 views)
Convex Optimization: Algorithms and Complexity
by Sebastien Bubeck - arXiv.org
This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.
(6248 views)
by Sebastien Bubeck - arXiv.org
This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.
(6248 views)
Lectures on Optimization: Theory and Algorithms
by John Cea - Tata Institute of Fundamental Research
Contents: Differential Calculus in Normed Linear Spaces; Minimization of Functionals; Minimization Without Constraints; Minimization with Constraints; Duality and Its Applications; Elements of the Theory of Control and Elements of Optimal Design.
(10776 views)
by John Cea - Tata Institute of Fundamental Research
Contents: Differential Calculus in Normed Linear Spaces; Minimization of Functionals; Minimization Without Constraints; Minimization with Constraints; Duality and Its Applications; Elements of the Theory of Control and Elements of Optimal Design.
(10776 views)