Atenção!


O atendimento às questões referentes ao Repositório Institucional será interrompido entre os dias 20 de dezembro de 2024 a 5 de janeiro de 2025.

Pedimos a sua compreensão e aproveitamos para desejar boas festas!

 

On the hypercomplex-based search spaces for optimization purposes

dc.contributor.authorPapa, João Paulo [UNESP]
dc.contributor.authorde Rosa, Gustavo Henrique [UNESP]
dc.contributor.authorYang, Xin-She
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.contributor.institutionMiddlesex University London
dc.date.accessioned2022-04-30T04:08:44Z
dc.date.available2022-04-30T04:08:44Z
dc.date.issued2018-01-01
dc.description.abstractMost applications can be modeled using real-valued algebra. Nevertheless, certain problems may be better addressed using different mathematical tools. In this context, complex numbers can be viewed as an alternative to standard algebra, where imaginary numbers allow a broader collection of tools to deal with different types of problems. In addition, hypercomplex numbers extend naïve complex algebra by means of additional imaginary numbers, such as quaternions and octonions. In this work, we will review the literature concerning hypercomplex spaces with an emphasis on the main concepts and fundamentals that build the quaternion and octonion algebra, and why they are interesting approaches that can overcome some potential drawbacks of certain optimization techniques. We show that quaternion- and octonion-based algebra can be used to different optimization problems, allowing smoother fitness landscapes and providing better results than those represented in standard search spaces.en
dc.description.affiliationSchool of Sciences São Paulo State University
dc.description.affiliationDepartment of Computing São Paulo State University
dc.description.affiliationSchool of Science and Technology Middlesex University London
dc.description.affiliationUnespSchool of Sciences São Paulo State University
dc.description.affiliationUnespDepartment of Computing São Paulo State University
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.description.sponsorshipIdFAPESP: #2014/12236-1
dc.description.sponsorshipIdFAPESP: #2014/16250-1
dc.description.sponsorshipIdFAPESP: #2015/25739-4
dc.description.sponsorshipIdCNPq: #306166/2014-3
dc.format.extent119-147
dc.identifierhttp://dx.doi.org/10.1007/978-3-319-67669-2_6
dc.identifier.citationStudies in Computational Intelligence, v. 744, p. 119-147.
dc.identifier.doi10.1007/978-3-319-67669-2_6
dc.identifier.issn1860-949X
dc.identifier.scopus2-s2.0-85033725850
dc.identifier.urihttp://hdl.handle.net/11449/232677
dc.language.isoeng
dc.relation.ispartofStudies in Computational Intelligence
dc.sourceScopus
dc.subjectHypercomplex numbers
dc.subjectMeta-heuristic
dc.subjectOctonions
dc.subjectOptimization
dc.subjectQuaternions
dc.titleOn the hypercomplex-based search spaces for optimization purposesen
dc.typeCapítulo de livro
unesp.campusUniversidade Estadual Paulista (Unesp), Faculdade de Ciências, Baurupt
unesp.departmentComputação - FCpt

Arquivos