Sciweavers

24 search results - page 1 / 5
» Explicit Reformulations for Robust Optimization Problems wit...
Sort
View
84
Voted
SIAMJO
2008
85views more  SIAMJO 2008»
14 years 10 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
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...
Igor Averbakh, Yun-Bin Zhao
TSP
2008
124views more  TSP 2008»
14 years 10 months ago
Robust Beamforming via Worst-Case SINR Maximization
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...
Seung-Jean Kim, Alessandro Magnani, Almir Mutapcic...
PPDP
2010
Springer
14 years 9 months ago
A declarative approach to robust weighted Max-SAT
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...
Miquel Bofill, Dídac Busquets, Mateu Villar...
SIAMJO
2002
102views more  SIAMJO 2002»
14 years 10 months ago
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
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 ...
Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos
ICCV
2007
IEEE
16 years 13 days ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
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...
Martin Bujnak, Radim Sára