Selected topics in robust convex optimization

By Aharon Ben-Tal, Arkadi Nemirovski. Mathematical programming, 2007

388 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Robust intermodal hub location under polyhedral demand uncertainty (2016, neutral): “…one whose worst case performance over all possible realizations in the uncertainty set is the best (see, e.g., Atamtürk, 2006; Ben-Tal et al., 2004; Ben-Tal and Nemirovski, 1998, 1999, 2008; Bertsimas and Sim, 20 03, 20 04; Mudchanatongsuk et al., 20 08; Ordóñez and Zhao, 2007; Yaman et al., 2001,…”
MULTI-LEADER-FOLLOWER GAMES: MODELS, METHODS AND APPLICATIONS (2015, background): “In the latter models, each player makes a decision according to the concept of robust optimization [6–8].”
ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS (2014, background): “Robust optimization, which has emerged as a powerful deterministic approach for studying optimization problems under uncertainty [3, 5, 6, 7], associates with the uncertain program (UP) its robust counterpart [2, 4, 16], (RP) inf{f(x) | gi(x, vi) ≤ 0, ∀vi ∈ Vi, i = 1, .”
Robust Optimization (2021, background): “1) and from [16] (infinite horizon results).”
Recent advances in robust optimization: An overview (2014, background): “The reader is referred to Ben-Tal and Nemirovski (2008) and Bertsimas et al. (2011a) for comprehensive surveys of robust optimization and to Ben-Tal et al. (2009) for a book treatment of the topic.”