Sciweavers

3250 search results - page 262 / 650
» An Algorithm to Solve a Linear Program
Sort
View
MP
2010
94views more  MP 2010»
15 years 5 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
15 years 1 months ago
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...
CVPR
2012
IEEE
13 years 9 months ago
A simple prior-free method for non-rigid structure-from-motion factorization
This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems. Other than using the basic low-rank condition, our method ...
Yuchao Dai, Hongdong Li, Mingyi He
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
16 years 1 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...