An information global minimization algorithm using the local improvement technique

Authors:
Daniela Lera;Yaroslav D. Sergeyev
Affiliations:
Dipartimento di Matematica e Informatica, Università di Cagliari, Cagliari, Italy;Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria and the Institute of High Performance Computing and Networking of the National Research Council of Italy, Re ...
Venue:
Journal of Global Optimization
Year:
2010

Citing 7
Cited 1

New computer methods for global optimization

New computer methods for global optimization
Spacefilling curves and the planar travelling salesman problem

Journal of the ACM (JACM)
Global optimization of univariate Lipschitz functions II: new algorithms and computational comparison

Mathematical Programming: Series A and B
Global one-dimensional optimization using smooth auxiliary functions

Mathematical Programming: Series A and B
Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering

SIAM Journal on Optimization
Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization

ACM Transactions on Mathematical Software (TOMS)
Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications)

Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications)

Lipschitz gradients for global optimization in a one-point-based partitioning scheme

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the global optimization problem with a multiextremal objective function satisfying the Lipschitz condition over a hypercube is considered. An algorithm that belongs to the class of information methods introduced by R.G. Strongin is proposed. The knowledge of the Lipschitz constant is not supposed. The local tuning on the behavior of the objective function and a new technique, named the local improvement, are used in order to accelerate the search. Two methods are presented: the first one deals with the one-dimensional problems and the second with the multidimensional ones (by using Peano-type space-filling curves for reduction of the dimension of the problem). Convergence conditions for both algorithms are given. Numerical experiments executed on more than 600 functions show quite a promising performance of the new techniques.