24 search results - page 1 / 5 » Explicit Reformulations for Robust Optimization Problems wit... |
104
click to vote
SIAMJO
2008
15 years 29 days ago
2008
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
85
Voted
TSP
2008
15 years 28 days ago
2008
Minimum variance beamforming, which uses a weight vector that maximizes the signal-to-interference-plus-noise ratio (SINR), is often sensitive to estimation error and uncertainty i...
114
Voted
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
99
Voted
SIAMJO
2002
15 years 21 days ago
2002
We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U. The robust ...
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...