Add to ORKGIn this paper, the Lipschitz global optimization problem is considered both in the cases of non-differentiable and differentiable objective functions over hyperintervals. It is shown that space-filling curves can be successfully used to extend promising one-dimensional methods to the multidimensional case. In particular, several DIRECT-based algorithms using Peano-Hilbert space-filling curves and adaptive diagonal curves are surveyed
AbstractA global optimization problem is studied where the objective function f(x) is a multidimensi...
In this article, multi-dimensional global optimization problems are considered, where the objective ...
In this article, multi-dimensional global optimization problems are considered, where the objective ...
In this paper, the Lipschitz global optimization problem is considered both in the cases of non-diff...
In this paper the global optimization problem where the objective function is multiextremal and sati...
In this paper the global optimization problem where the objective function is multiextremal and sati...
Many real-world problems involve multivariate global optimization which can be difficult to solve. I...
Many real-world problems involve multivariate global optimization which can be difficult to solve. I...
In this paper, the global optimization problem min F(y) y∈S, with S=[a,b], a, b ∈ R^N, and F(y) sati...
In this paper, the global optimization problem miny∈SF(y) with S being a hyperinterval in RN and F(y...
In this paper the global optimization problem of a multiextremal function satisfying the Lipschitz ...
The problem of finding the global minimum of a real function on a set S ⊆ RN occurs in many real wor...
In this paper, the global optimization problem miny∈SF(y) with S being a hyperinterval in RN and F(y...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
Global optimization is a field of mathematical programming dealing with finding global (absolute) mi...
AbstractA global optimization problem is studied where the objective function f(x) is a multidimensi...
In this article, multi-dimensional global optimization problems are considered, where the objective ...
In this article, multi-dimensional global optimization problems are considered, where the objective ...
In this paper, the Lipschitz global optimization problem is considered both in the cases of non-diff...
In this paper the global optimization problem where the objective function is multiextremal and sati...
In this paper the global optimization problem where the objective function is multiextremal and sati...
Many real-world problems involve multivariate global optimization which can be difficult to solve. I...
Many real-world problems involve multivariate global optimization which can be difficult to solve. I...
In this paper, the global optimization problem min F(y) y∈S, with S=[a,b], a, b ∈ R^N, and F(y) sati...
In this paper, the global optimization problem miny∈SF(y) with S being a hyperinterval in RN and F(y...
In this paper the global optimization problem of a multiextremal function satisfying the Lipschitz ...
The problem of finding the global minimum of a real function on a set S ⊆ RN occurs in many real wor...
In this paper, the global optimization problem miny∈SF(y) with S being a hyperinterval in RN and F(y...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
Global optimization is a field of mathematical programming dealing with finding global (absolute) mi...
AbstractA global optimization problem is studied where the objective function f(x) is a multidimensi...
In this article, multi-dimensional global optimization problems are considered, where the objective ...
In this article, multi-dimensional global optimization problems are considered, where the objective ...