A One-Layer Recurrent Neural Network for Non-smooth Convex Optimization Subject to Linear Equality Constraints

In this paper, a one-layer recurrent neural network is proposed for solving non-smooth convex optimization problems with linear equality constraints. Comparing with the existing neural networks, the proposed neural network has simpler architecture and the number of neurons is the same as that of decision variables in the optimization problems. The global convergence of the neural network can be guaranteed if the non-smooth objective function is convex. Simulation results are provided to show that the state trajectories of the neural network can converge to the optimal solutions of the non-smooth convex optimization problems and show the performance of the proposed neural network.

[1]  Jun Wang,et al.  A general projection neural network for solving monotone variational inequalities and related optimization problems , 2004, IEEE Transactions on Neural Networks.

[2]  John J. Hopfield,et al.  Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit , 1986 .

[3]  Jun Wang.  Analysis and design of a recurrent neural network for linear programming , 1993 .

[4]  J. Aubin,et al.  Differential inclusions set-valued maps and viability theory , 1984 .

[5]  Jun Wang,et al.  A projection neural network and its application to constrained optimization problems , 2002 .

[6]  Qingshan Liu,et al.  A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming , 2008, Neural Computation.

[7]  Xiaolin Hu,et al.  Solving Pseudomonotone Variational Inequalities and Pseudoconvex Optimization Problems Using the Projection Neural Network , 2006, IEEE Transactions on Neural Networks.

[8]  Jacek M. Zurada,et al.  Advances in Neural Networks - ISNN 2006, Third International Symposium on Neural Networks, Chengdu, China, May 28 - June 1, 2006, Proceedings, Part I , 2006, International Symposium on Neural Networks.

[9]  Jun Wang,et al.  Neural networks for solving least absolute and related problems , 1998, Neurocomputing.

[10]  Shiji Song,et al.  A Neural Network Model for Non-smooth Optimization over a Compact Convex Subset , 2006, ISNN.

[11]  Qingshan Liu,et al.  A One-Layer Recurrent Neural Network With a Discontinuous Hard-Limiting Activation Function for Quadratic Programming , 2008, IEEE Transactions on Neural Networks.

[12]  Jun Wang,et al.  On the Stability of Globally Projected Dynamical Systems , 2000 .

[13]  J Wang,et al.  Analysis and design of primal-dual assignment networks , 1998, IEEE Trans. Neural Networks.

[14]  Leon O. Chua,et al.  Neural networks for nonlinear programming , 1988 .

[15]  Aleksej F. Filippov,et al.  Differential Equations with Discontinuous Righthand Sides , 1988, Mathematics and Its Applications.

[16]  Qingshan Liu,et al.  A Recurrent Neural Network for Non-smooth Convex Programming Subject to Linear Equality and Bound Constraints , 2006, ICONIP.

[17]  Jun Wang,et al.  A deterministic annealing neural network for convex programming , 1994, Neural Networks.

[18]  M. Forti,et al.  Global convergence of neural networks with discontinuous neuron activations , 2003 .

[19]  Jinde Cao,et al.  Solving Quadratic Programming Problems by Delayed Projection Neural Network , 2006, IEEE Transactions on Neural Networks.

[20]  Shengwei Zhang,et al.  Lagrange programming neural networks , 1992 .