Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms (Articolo in rivista)

Type

• Prodotto della ricerca (Classe)
• Articolo in rivista (Classe)

Label

• Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms (Articolo in rivista) (literal)

Anno

• 2005-01-01T00:00:00+01:00 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi

• 10.1007/s10957-004-0948-7 (literal)

Alternative label

• Sergeyev Ya.D. (2005)
  Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms
  in Journal of optimization theory and applications; Springer Science+Business Media, Berlin, Heidelberg (Germania)
  (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

• Sergeyev Ya.D. (literal)

Pagina inizio

• 503 (literal)

Pagina fine

• 510 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

• 124 (literal)

Rivista

• Journal of optimization theory and applications (Rivista)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali

• 8 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo

• 2 (literal)

Note

• ISI Web of Science (WOS) (literal)
• Scopu (literal)
• Mathematical Reviews on the web (MathSciNet) (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

• 1) Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Rende, Cosenza, Italy; 2) University of Nizhni Novgorod, Nizhni Novgorod, Russia. (literal)

Titolo

• Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms (literal)

Abstract

• In this paper, the problem of the minimal description of the structure of a vector function f(x) over an N-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x) at only one point within each subinterval are considered. Two partition strategies traditionally used for solving this problem are analyzed. A new partition strategy based on an efficient technique developed for diagonal algorithms is proposed and studied. (literal)

Editore

• Springer Science+Business Media (Editore)

Prodotto di

• Institute for high performance computing and networking (ICAR) (Istituto)
• Gestire, Estrarre Conoscenza e Ragionare sui Dati (ICT.P08.002.001) (Modulo)

Autore CNR

• YAROSLAV SERGEEV (Unità di personale esterno)

Insieme di parole chiave

• Keywords of "Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms" (Insieme di parole chiave)

Incoming links:

Prodotto

• Institute for high performance computing and networking (ICAR) (Istituto)
• Gestire, Estrarre Conoscenza e Ragionare sui Dati (ICT.P08.002.001) (Modulo)

Autore CNR di

• YAROSLAV SERGEEV (Unità di personale esterno)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi

• Journal of optimization theory and applications (Rivista)

Editore di

• Springer Science+Business Media (Editore)

Insieme di parole chiave di

• Keywords of "Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms" (Insieme di parole chiave)