From constraints fusion to manifold optimization: A new directional transport manifold metaheuristic algorithm
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F25%3A10256863" target="_blank" >RIV/61989100:27240/25:10256863 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S1566253524003749?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S1566253524003749?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.inffus.2024.102596" target="_blank" >10.1016/j.inffus.2024.102596</a>
Alternative languages
Result language
angličtina
Original language name
From constraints fusion to manifold optimization: A new directional transport manifold metaheuristic algorithm
Original language description
The ascent of geometry-based models and methodologies, exemplified by geometric deep learning and manifold numerical optimization algorithms, has inaugurated a novel domain across various applications that grapple with geometric data complexities, such as electroencephalogram signals represented by symmetric positive definite matrix manifold, hierarchical data represented by hyperbolic manifold. The imperative fuels this inevitable paradigm shift to encapsulate the intricacies and richness inherent in data, areas where traditional methods prove inadequate. While metaheuristic algorithms are renowned for their versatile adaptability across applications, offering practical solutions within reasonable timeframes. However, the conventional metaheuristic algorithms fail on manifold applications with meaningless solutions. From an extrinsic optimization perspective, we treat manifold optimization problems as general optimization problems with multiple fused constraints that limit the optimization path to the manifold. This study pioneered the proposal and implementation of a metaheuristic manifold optimization, introducing a novel directional transport operator to rectify previously identified issues. Through experimentation across five sets of 25 problems, comparing against five algorithms, including both gradient-free and gradient-dominant counterparts, our proposed algorithm emerges as the optimal performer within the gradient-free category, demonstrating competitiveness even against gradient-dominant algorithms. Furthermore, we applied the proposed algorithm to the robot dynamic manipulation problem, achieving a close-optimal solution that eludes gradient-dominant approaches. This paper delves into the inherent capabilities and establishes the generalization of a metaheuristic algorithm within non-Euclidean functional landscapes. The source code will be available at https://github.com/lingping-fuzzy/metaheuristic-manifold-optimization. © 2024
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
<a href="/en/project/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotics and advanced industrial production</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Information Fusion
ISSN
1566-2535
e-ISSN
1872-6305
Volume of the periodical
113
Issue of the periodical within the volume
srpen 2024
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
nestránkováno
UT code for WoS article
001289692000001
EID of the result in the Scopus database
2-s2.0-85200441405