• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种用于求解二次规划问题的新型单层神经网络。

A novel one-layer neural network for solving quadratic programming problems.

作者信息

Gao Xingbao, Du Lili

机构信息

School of Mathematics and Statistics, Shaanxi Normal University, Xi'an, Shaanxi, 710119, China.

出版信息

Neural Netw. 2025 Jul;187:107344. doi: 10.1016/j.neunet.2025.107344. Epub 2025 Mar 12.

DOI:10.1016/j.neunet.2025.107344
PMID:40101561
Abstract

This paper proposes a novel one-layer neural network to solve quadratic programming problems in real time by using a control parameter and transforming the optimality conditions into a system of projection equations. The proposed network includes two existing dual networks as its special cases, and an existing model can be derived from it. In particular, another new model for linear and quadratic programming problems can be obtained from the proposed network. Meanwhile, a new Lyapunov function is constructed to ensure that the proposed network is Lyapunov stable and can converge to an optimal solution of the concerned problem under mild conditions. In contrast with the existing models for quadratic programming, the proposed network requires the least neurons while maintaining weaker stability conditions. The effectiveness and characteristics of the proposed model are demonstrated by the limited simulation results.

摘要

本文提出了一种新颖的单层神经网络,通过使用控制参数并将最优性条件转化为投影方程组来实时求解二次规划问题。所提出的网络包含两个现有的对偶网络作为其特殊情况,并且可以从中推导出一个现有模型。特别地,从所提出的网络可以得到另一个用于线性和二次规划问题的新模型。同时,构造了一个新的李雅普诺夫函数,以确保所提出的网络是李雅普诺夫稳定的,并且在温和条件下能够收敛到相关问题的最优解。与现有的二次规划模型相比,所提出的网络在保持较弱稳定性条件的同时所需神经元最少。有限的仿真结果证明了所提出模型的有效性和特性。

相似文献

1
A novel one-layer neural network for solving quadratic programming problems.一种用于求解二次规划问题的新型单层神经网络。
Neural Netw. 2025 Jul;187:107344. doi: 10.1016/j.neunet.2025.107344. Epub 2025 Mar 12.
2
A new one-layer neural network for linear and quadratic programming.一种用于线性和二次规划的新型单层神经网络。
IEEE Trans Neural Netw. 2010 Jun;21(6):918-29. doi: 10.1109/TNN.2010.2045129. Epub 2010 Apr 12.
3
An improved dual neural network for solving a class of quadratic programming problems and its k-winners-take-all application.一种用于解决一类二次规划问题的改进型双神经网络及其胜者全得应用。
IEEE Trans Neural Netw. 2008 Dec;19(12):2022-31. doi: 10.1109/TNN.2008.2003287.
4
Neural network for solving convex quadratic bilevel programming problems.用于求解凸二次双层规划问题的神经网络。
Neural Netw. 2014 Mar;51:17-25. doi: 10.1016/j.neunet.2013.11.015. Epub 2013 Nov 25.
5
A new gradient-based neural network for solving linear and quadratic programming problems.一种用于求解线性和二次规划问题的基于梯度的新型神经网络。
IEEE Trans Neural Netw. 2001;12(5):1074-83. doi: 10.1109/72.950137.
6
A class of finite-time dual neural networks for solving quadratic programming problems and its k-winners-take-all application.一类求解二次规划问题的有限时间对偶神经网络及其 k-胜者全拿应用
Neural Netw. 2013 Mar;39:27-39. doi: 10.1016/j.neunet.2012.12.009. Epub 2013 Jan 7.
7
A delayed neural network for solving linear projection equations and its analysis.一种用于求解线性投影方程的延迟神经网络及其分析。
IEEE Trans Neural Netw. 2005 Jul;16(4):834-43. doi: 10.1109/TNN.2005.849834.
8
A Projection Neural Network for Constrained Quadratic Minimax Optimization.一种用于约束二次最小极大优化的投影神经网络。
IEEE Trans Neural Netw Learn Syst. 2015 Nov;26(11):2891-900. doi: 10.1109/TNNLS.2015.2425301. Epub 2015 May 7.
9
Solving quadratic programming problems by delayed projection neural network.利用延迟投影神经网络求解二次规划问题。
IEEE Trans Neural Netw. 2006 Nov;17(6):1630-4. doi: 10.1109/TNN.2006.880579.
10
A Barrier Varying-Parameter Dynamic Learning Network for Solving Time-Varying Quadratic Programming Problems With Multiple Constraints.用于求解具有多个约束的时变二次规划问题的变参数动态学习网络障碍。
IEEE Trans Cybern. 2022 Sep;52(9):8781-8792. doi: 10.1109/TCYB.2021.3051261. Epub 2022 Aug 18.