A partition-based global optimization algorithm (Articolo in rivista)

Type
Label
  • A partition-based global optimization algorithm (Articolo in rivista) (literal)
Anno
  • 2010-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/s10898-009-9515-y (literal)
Alternative label
  • Liuzzi, G.; Lucidi, S.; Piccialli, V. (2010)
    A partition-based global optimization algorithm
    in Journal of global optimization; Springer, New York (Stati Uniti d'America)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Liuzzi, G.; Lucidi, S.; Piccialli, V. (literal)
Pagina inizio
  • 113 (literal)
Pagina fine
  • 128 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.springerlink.com/content/t64816517m40540m/ (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 48 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 1 (literal)
Note
  • Scopu (literal)
  • Mathematical Reviews on the web (MathSciNet) (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Liuzzi G.: IASI, CNR Lucidi S.: Università di Roma \"La Sapienza\" Piccialli V.: Università di Roma \"Tor Vergata\" (literal)
Titolo
  • A partition-based global optimization algorithm (literal)
Abstract
  • This paper is devoted to the study of partition-based deterministic algorithms for global optimization of Lipschitz-continuous functions without requiring knowledge of the Lipschitz constant. First we introduce a general scheme of a partition-based algorithm. Then, we focus on the selection strategy in such a way to exploit the information on the objective function. We propose two strategies. The first one is based on the knowledge of the global optimum value of the objective function. In this case the selection strategy is able to guarantee convergence of every infinite sequence of trial points to global minimum points. The second one does not require any a priori knowledge on the objective function and tries to exploit information on the objective function gathered during progress of the algorithm. In this case, from a theoretical point of view, we can guarantee the so-called every-where dense convergence of the algorithm. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Editore di
Insieme di parole chiave di
data.CNR.it