Sciweavers

116 search results - page 11 / 24
» Reformulation and convex relaxation techniques for global op...
Sort
View
SARA
2009
Springer
14 years 2 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
CVPR
2008
IEEE
14 years 9 months ago
Enforcing convexity for improved alignment with constrained local models
Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A maj...
Yang Wang, Simon Lucey, Jeffrey F. Cohn
CORR
2011
Springer
133views Education» more  CORR 2011»
12 years 11 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
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
13 years 9 months ago
Convex formulations of aggregate network air traffic flow optimization problems
The problem of regulating air traffic in the en route airspace of the National Airspace System is studied using an Eulerian network model to describe air traffic flow. The evolutio...
Daniel B. Work, Alexandre M. Bayen
INFOCOM
2012
IEEE
11 years 10 months ago
Algorithm design for femtocell base station placement in commercial building environments
Abstract—Although femtocell deployments in residential buildings have been increasingly prevalent, femtocell deployment in commercial building environments remains in its infancy...
Jia Liu, Qian Chen, Hanif D. Sherali