The Neural Network for Solving Convex Nonlinear Programming Problem

摘要

In this paper, a neural network model for solving convex nonlinear programming problems is investigated based on the Fischer-Burmeister function and steepest descent method. The proposed neural network is proved to be stable in the sense of Lyapunov and can converge to an optimal solution of the original optimization problem. An example shows the effectiveness of the proposed neural network model.