Acceleration Tools for Diagonal Information Global Optimization Algorithms

  • Authors:

  • Anna Molinaro;Clara Pizzuti;Yaroslav D. Sergeyev

  • Affiliations:

  • Dip. Elettronica, Informatica e Sistemistica, Università/ della Calabria, 87030 Rende (CS), Italy. molinaro@nwdeis1.unical.it;Istituto per la Sistemistica e l' Informatica—/C.N.R., c/o, D.E.I.S.—/Università/ della Calabria, 87030 Rende (CS), Italy. pizzuti@si.deis.unical.it;Istituto per la Sistemistica e l' Informatica—/C.N.R., c/o, D.E.I.S.—/Università/ della Calabria, 87030 Rende (CS), Italy&semi/ University of Nizhni Novgorod, Gagarin Av., 23, Nizhni ...

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we face a classical global optimization problem—minimization of a multiextremal multidimensional Lipschitz function over a hyperinterval. We introduce two new diagonal global optimization algorithms unifying the power of the following three approaches: efficient univariate information global optimization methods, diagonal approach for generalizing univariate algorithms to the multidimensional case, and local tuning on the behaviour of the objective function (estimates of the local Lipschitz constants over different subregions) during the global search. Global convergence conditions of a new type are established for the diagonal information methods. The new algorithms demonstrate quite satisfactory performance in comparison with the diagonal methods using only global information about the Lipschitz constant.