Gao Xing-Bao
College of Mathematics and Information Science, Shaanxi Normal University, Xi'an, Shaanxi 710062, PR China.
IEEE Trans Neural Netw. 2004 May;15(3):613-21. doi: 10.1109/TNN.2004.824425.
In this paper, we present a neural network for solving the nonlinear convex programming problem in real time by means of the projection method. The main idea is to convert the convex programming problem into a variational inequality problem. Then a dynamical system and a convex energy function are constructed for resulting variational inequality problem. It is shown that the proposed neural network is stable in the sense of Lyapunov and can converge to an exact optimal solution of the original problem. Compared with the existing neural networks for solving the nonlinear convex programming problem, the proposed neural network has no Lipschitz condition, no adjustable parameter, and its structure is simple. The validity and transient behavior of the proposed neural network are demonstrated by some simulation results.
在本文中,我们提出了一种神经网络,通过投影方法实时求解非线性凸规划问题。主要思想是将凸规划问题转化为变分不等式问题。然后针对所得变分不等式问题构建一个动力系统和一个凸能量函数。结果表明,所提出的神经网络在李雅普诺夫意义下是稳定的,并且能够收敛到原始问题的精确最优解。与现有的用于求解非线性凸规划问题的神经网络相比,所提出的神经网络没有利普希茨条件,没有可调参数,并且其结构简单。一些仿真结果证明了所提出神经网络的有效性和暂态行为。