• español
  • English
  • français
  • Deutsch
  • português (Brasil)
  • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UVaDOCCommunitiesBy Issue DateAuthorsSubjectsTitles

    My Account

    Login

    Statistics

    View Usage Statistics

    Share

    View Item 
    •   UVaDOC Home
    • SCIENTIFIC PRODUCTION
    • Institutos de Investigación
    • Instituto de las Tecnologías Avanzadas en la Producción (ITAP)
    • ITAP - Artículos de revista
    • View Item
    •   UVaDOC Home
    • SCIENTIFIC PRODUCTION
    • Institutos de Investigación
    • Instituto de las Tecnologías Avanzadas en la Producción (ITAP)
    • ITAP - Artículos de revista
    • View Item
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano

    Export

    RISMendeleyRefworksZotero
    • edm
    • marc
    • xoai
    • qdc
    • ore
    • ese
    • dim
    • uketd_dc
    • oai_dc
    • etdms
    • rdf
    • mods
    • mets
    • didl
    • premis

    Citas

    Por favor, use este identificador para citar o enlazar este ítem:https://uvadoc.uva.es/handle/10324/57321

    Título
    A direct search algorithm for global optimization
    Autor
    Baeyens Lázaro, EnriqueAutoridad UVA Orcid
    Herreros López, AlbertoAutoridad UVA Orcid
    Perán, José
    Año del Documento
    2016
    Editorial
    MDPI
    Descripción
    Producción Científica
    Documento Fuente
    Algorithms, 2016, vol. 9, n. 2, p. 40
    Abstract
    A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is differentiable and its gradient is Lipschitz continuous. The algorithm’s performance has been extensively tested using benchmark functions and compared to some well-known global optimization algorithms. The results of the computational study show that the algorithm combines both simplicity and efficiency and is competitive with the heuristics-based strategies presently used for global optimization.
    Materias Unesco
    33 Ciencias Tecnológicas
    12 Matemáticas
    Palabras Clave
    Global optimization
    Direct search methods
    Search space transformation
    Revisión por pares
    SI
    DOI
    10.3390/a9020040
    Version del Editor
    https://www.mdpi.com/1999-4893/9/2/40
    Propietario de los Derechos
    © 2016 The Author(s)
    Idioma
    eng
    URI
    https://uvadoc.uva.es/handle/10324/57321
    Tipo de versión
    info:eu-repo/semantics/publishedVersion
    Derechos
    openAccess
    Collections
    • ITAP - Artículos de revista [31]
    Show full item record
    Files in this item
    Nombre:
    Direct-search-algorithm.pdf
    Tamaño:
    1.232Mb
    Formato:
    Adobe PDF
    Thumbnail
    FilesOpen
    Atribución 4.0 InternacionalExcept where otherwise noted, this item's license is described as Atribución 4.0 Internacional

    Comentarios

    Universidad de Valladolid

    Powered by MIT's. DSpace software, Version 5.10