Sciweavers

17 search results - page 1 / 4
» Integer Optimization on Convex Semialgebraic Sets
Sort
View
DCG
2000
53views more  DCG 2000»
13 years 5 months ago
Integer Optimization on Convex Semialgebraic Sets
Leonid Khachiyan, Lorant Porkolab
ICCV
2009
IEEE
13 years 3 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
MP
2008
99views more  MP 2008»
13 years 5 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
CORR
2011
Springer
133views Education» more  CORR 2011»
12 years 9 months ago
Minimizing the sum of many rational functions
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
Florian Bugarin, Didier Henrion, Jean B. Lasserre
MP
2010
128views more  MP 2010»
13 years 3 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth