Logo

Robust Optimization by A. Ben-Tal, L. El Ghaoui, A. Nemirovski

Large book cover: Robust Optimization

Robust Optimization
by

Publisher: Princeton University Press
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.

Home page url

Download or read it online for free here:
Read online
(online reading)

Similar books

Book cover: An Introduction to Nonlinear Optimization TheoryAn Introduction to Nonlinear Optimization Theory
by - De Gruyter Open
Starting with the case of differentiable data and the classical results on constrained optimization problems, continuing with the topic of nonsmooth objects involved in optimization, the book concentrates on both theoretical and practical aspects.
(2537 views)
Book cover: Data Assimilation: A Mathematical IntroductionData Assimilation: A Mathematical Introduction
by - arXiv.org
This book provides a systematic treatment of the mathematical underpinnings of work in data assimilation. Authors develop a framework in which a Bayesian formulation of the problem provides the bedrock for the derivation and analysis of algorithms.
(1634 views)
Book cover: Iterative Methods for OptimizationIterative Methods for Optimization
by - Society for Industrial Mathematics
This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis.
(6682 views)
Book cover: Convex Optimization: Algorithms and ComplexityConvex Optimization: Algorithms and Complexity
by - 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.
(1429 views)