On the hypercomplex-based search spaces for optimization purposes
dc.contributor.author | Papa, João Paulo [UNESP] | |
dc.contributor.author | de Rosa, Gustavo Henrique [UNESP] | |
dc.contributor.author | Yang, Xin-She | |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | |
dc.contributor.institution | Middlesex University London | |
dc.date.accessioned | 2022-04-30T04:08:44Z | |
dc.date.available | 2022-04-30T04:08:44Z | |
dc.date.issued | 2018-01-01 | |
dc.description.abstract | Most 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.affiliation | School of Sciences São Paulo State University | |
dc.description.affiliation | Department of Computing São Paulo State University | |
dc.description.affiliation | School of Science and Technology Middlesex University London | |
dc.description.affiliationUnesp | School of Sciences São Paulo State University | |
dc.description.affiliationUnesp | Department of Computing São Paulo State University | |
dc.description.sponsorship | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description.sponsorship | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
dc.description.sponsorshipId | FAPESP: #2014/12236-1 | |
dc.description.sponsorshipId | FAPESP: #2014/16250-1 | |
dc.description.sponsorshipId | FAPESP: #2015/25739-4 | |
dc.description.sponsorshipId | CNPq: #306166/2014-3 | |
dc.format.extent | 119-147 | |
dc.identifier | http://dx.doi.org/10.1007/978-3-319-67669-2_6 | |
dc.identifier.citation | Studies in Computational Intelligence, v. 744, p. 119-147. | |
dc.identifier.doi | 10.1007/978-3-319-67669-2_6 | |
dc.identifier.issn | 1860-949X | |
dc.identifier.scopus | 2-s2.0-85033725850 | |
dc.identifier.uri | http://hdl.handle.net/11449/232677 | |
dc.language.iso | eng | |
dc.relation.ispartof | Studies in Computational Intelligence | |
dc.source | Scopus | |
dc.subject | Hypercomplex numbers | |
dc.subject | Meta-heuristic | |
dc.subject | Octonions | |
dc.subject | Optimization | |
dc.subject | Quaternions | |
dc.title | On the hypercomplex-based search spaces for optimization purposes | en |
dc.type | Capítulo de livro | |
unesp.campus | Universidade Estadual Paulista (Unesp), Faculdade de Ciências, Bauru | pt |
unesp.department | Computação - FC | pt |