Solving Constrained Pseudoconvex Optimization Problems with deep learning-based neurodynamic optimization

MATHEMATICS AND COMPUTERS IN SIMULATION(2024)

引用 0|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
Constrained Pseudoconvex Optimization,Problems,Neurodynamic optimization,Neural networks,Ordinary differential equations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要