Sciweavers

2126 search results - page 43 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
JC
2007
94views more  JC 2007»
14 years 9 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
COLT
2008
Springer
14 years 11 months ago
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
Jacob Abernethy, Elad Hazan, Alexander Rakhlin
JGO
2010
112views more  JGO 2010»
14 years 8 months ago
An information global minimization algorithm using the local improvement technique
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
Daniela Lera, Yaroslav D. Sergeyev
COCOA
2007
Springer
15 years 4 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
ISCI
2007
105views more  ISCI 2007»
14 years 9 months ago
A hybrid genetic algorithm and bacterial foraging approach for global optimization
The social foraging behavior of Escherichia coli bacteria has been used to solve optimization problems. This paper proposes a hybrid approach involving genetic algorithms (GA) and...
Dong Hwa Kim, Ajith Abraham, Jae Hoon Cho