Sciweavers

577 search results - page 16 / 116
» New interval methods for constrained global optimization
Sort
View
158
Voted
ICCV
2011
IEEE
14 years 3 months ago
Tracking Multiple People under Global Appearance Constraints
In this paper, we show that tracking multiple people whose paths may intersect can be formulated as a convex global optimization problem. Our proposed framework is designed to exp...
Horesh Ben Shitrit, Jerome Berclaz, Francois Fleur...
129
Voted
ICIP
2006
IEEE
16 years 5 months ago
Spatially Constrained Wiener Filter with Markov Autocorrelation Modeling for Image Resolution Enhancement
This paper develops a practical method for image resolution enhancement. The method optimizes the spatially constrained Wiener filter for an efficiently parameterized model of the...
Jiazheng Shi, Stephen E. Reichenbach
EOR
2006
130views more  EOR 2006»
15 years 3 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
169
Voted
MP
2002
195views more  MP 2002»
15 years 3 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
149
Voted
PPSN
1998
Springer
15 years 7 months ago
A Decoder-Based Evolutionary Algorithm for Constrained Parameter Optimization Problems
Several methods have been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; a survey paper [7] provides an overview of var...
Slawomir Koziel, Zbigniew Michalewicz