Sciweavers

34170 search results - page 139 / 6834
» Optimization
Sort
View
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 8 months ago
Benchmarking the NEWUOA on the BBOB-2009 noisy testbed
The NEWUOA which belongs to the class of DerivativeFree optimization algorithms is benchmarked on the BBOB2009 noisy testbed. A multistart strategy is applied with a maximum numbe...
Raymond Ros
CCO
2001
Springer
157views Combinatorics» more  CCO 2001»
15 years 7 months ago
Lagrangian Relaxation
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
Claude Lemaréchal
HYBRID
2007
Springer
15 years 7 months ago
A Hybrid Bellman Equation for Bimodal Systems
Abstract. In this paper we present a dynamic programming formulation of a hybrid optimal control problem for bimodal systems with regional dynamics. In particular, based on optimal...
Peter E. Caines, Magnus Egerstedt, Roland P. Malha...
GECCO
2010
Springer
253views Optimization» more  GECCO 2010»
15 years 5 months ago
Comparison of G3PCX and Rosenbrock's algorithms on the BBOB noiseless testbed
Generalized generation gap algorithm with parent centric crossover is compared with Rosenbrock’s optimization algorithm. Both algorithms were already presented at the BBOB 2009 ...
Petr Posík
116
Voted
IPCO
1996
89views Optimization» more  IPCO 1996»
15 years 4 months ago
On Dependent Randomized Rounding Algorithms
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra