Solving Constrained Pseudoconvex Optimization Problems with Deep Learning-Based Neurodynamic Optimization - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematics and Computers in Simulation Année : 2024

Solving Constrained Pseudoconvex Optimization Problems with Deep Learning-Based Neurodynamic Optimization

Dawen Wu
  • Fonction : Auteur
  • PersonId : 1110021
Abdel Lisser

Résumé

In this paper, we consider Constrained Pseudoconvex Nonsmooth Optimization Problems (CPNOPs), which are a class of nonconvex optimization problems. Due to their nonconvexity, classical convex optimization algorithms are unable to solve them, while existing methods, i.e., numerical integration methods, are inadequate in terms of computational performance. In this paper, we propose a novel approach for solving CPNOPs that combines neurodynamic optimization with deep learning. We construct an initial value problem (IVP) involving a system of ordinary differential equations for a CPNOP and use a surrogate model based on a neural network to approximate the IVP. Our approach transforms the CPNOP into a neural network training problem, leveraging the power of deep learning infrastructure to improve computational performance and eliminate the need for traditional optimization solvers. Our experimental results show that our approach is superior to numerical integration methods in terms of both solution quality and computational efficiency.
Fichier principal
Vignette du fichier
No__9_MATCOM_revision (2).pdf (668.43 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04370956 , version 1 (03-01-2024)

Identifiants

Citer

Dawen Wu, Abdel Lisser. Solving Constrained Pseudoconvex Optimization Problems with Deep Learning-Based Neurodynamic Optimization. Mathematics and Computers in Simulation, 2024, ⟨10.1016/j.matcom.2023.12.032⟩. ⟨hal-04370956⟩
14 Consultations
21 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More