Utilize este identificador para referenciar este registo: https://hdl.handle.net/1822/68919

TítuloPenalty-based heuristic direct method for constrained global optimization
Autor(es)Costa, M. Fernanda P.
Rocha, Ana Maria A. C.
Fernandes, Edite Manuela da G. P.
Palavras-chaveDIRECT method
Global optimization
Heuristic
Penalty auxiliary function
Data2020
EditoraSpringer
RevistaLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Resumo(s)This paper is concerned with an extension of the heuristic DIRECT method, presented in[8], to solve nonlinear constrained global optimization (CGO) problems. Using a penalty strategy based on a penalty auxiliary function, the CGO problem is transformed into a bound constrained problem. We have analyzed the performance of the proposed algorithm using fixed values of the penalty parameter, and we may conclude that the algorithm competes favourably with other DIRECT-type algorithms in the literature.
TipoArtigo em ata de conferência
URIhttps://hdl.handle.net/1822/68919
ISBN9783030588076
DOI10.1007/978-3-030-58808-3_39
ISSN0302-9743
Versão da editorahttps://link.springer.com/chapter/10.1007%2F978-3-030-58808-3_39
Arbitragem científicayes
AcessoAcesso aberto
Aparece nas coleções:CAlg - Artigos em livros de atas/Papers in proceedings
CMAT - Artigos em atas de conferências e capítulos de livros com arbitragem / Papers in proceedings of conferences and book chapters with peer review

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
heuristicDIRECT_penalty_CGO_revised.pdf347,2 kBAdobe PDFVer/Abrir

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID