18 search results - page 1 / 4 » On the Convergence of Feasibility based Bounds Tightening |
COLOGNETWENTE
2010
13 years 9 months ago
2010
COCOA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
CDC
2008
IEEE
14 years 5 months ago
2008
IEEE
— This paper develops a novel robust control method for linear systems subject to additive and bounded disturbances. The approach is based on constraint tightening method. The pr...
CP
2006
Springer
14 years 2 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
JMLR
2012
12 years 1 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...