The problem of finding the global minimum of a real function on a set S ⊆ RN occurs in many real world problems. In this paper, the global optimization problem with a multiextremal objective function satisfying the Lipschitz condition over a hypercube is considered. We propose a local tuning technique that adaptively estimates the local Lipschitz constants over different zones of the search region and a technique, called the local improvement, in order to accelerate the search. Peano-type space-filling curves for reduction of the dimension of the problem are used. Convergence condition are given. Numerical experiments executed on several hundreds of test functions show quite a promising performance of the introduced acceleration techniques.
Skip Nav Destination
Article navigation
20 October 2016
NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms”
19–25 June 2016
Pizzo Calabro, Italy
Research Article|
October 20 2016
Remarks on global optimization using space-filling curves
Daniela Lera;
Daniela Lera
1Dipartimento di Matematica e Informatica,
University of Cagliari
, Italy
Search for other works by this author on:
Yaroslav Sergeyev
Yaroslav Sergeyev
c)
2Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica,
University of Calabria
, Italy
3
Lobachevsky State University of Nizhni Novgorod
, Russia
Search for other works by this author on:
a)
Corresponding author: lera@unica.it
AIP Conf. Proc. 1776, 060010 (2016)
Citation
Daniela Lera, Yaroslav Sergeyev; Remarks on global optimization using space-filling curves. AIP Conf. Proc. 20 October 2016; 1776 (1): 060010. https://doi.org/10.1063/1.4965344
Download citation file:
Sign in
Don't already have an account? Register
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Sign in via your Institution
Sign in via your InstitutionPay-Per-View Access
$40.00
35
Views