Sciweavers

19 search results - page 1 / 4
» Optimal algorithms for global optimization in case of unknow...
Sort
View
DAGSTUHL
2004
13 years 6 months ago
Optimal algorithms for global optimization in case of unknown Lipschitz constant
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
Matthias U. Horn
CORR
2011
Springer
145views Education» more  CORR 2011»
12 years 11 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
JGO
2010
112views more  JGO 2010»
13 years 3 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
ICCV
2007
IEEE
14 years 6 months ago
The 3D-3D Registration Problem Revisited
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
Hongdong Li, Richard I. Hartley
JMLR
2012
11 years 7 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss