From constraints fusion to manifold optimization: A new directional transport manifold metaheuristic algorithm

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

From constraints fusion to manifold optimization: A new directional transport manifold metaheuristic algorithm

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

From constraints fusion to manifold optimization: A new directional transport manifold metaheuristic algorithm

Popis výsledku anglicky

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

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

<a href="/cs/project/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotika a pokročilá průmyslová výroba</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Information Fusion

ISSN

1566-2535

e-ISSN

1872-6305

Svazek periodika

113

Číslo periodika v rámci svazku

srpen 2024

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

13

Strana od-do

nestránkováno

Kód UT WoS článku

001289692000001

EID výsledku v databázi Scopus

2-s2.0-85200441405