Two Projection Neural Networks With Reduced Model Complexity for Nonlinear Programming

Recent reports show that projection neural networks with a low-dimensional state space can enhance computation speed obviously. This paper proposes two projection neural networks with reduced model dimension and complexity (RDPNNs) for solving nonlinear programming (NP) problems. Compared with existing projection neural networks for solving NP, the proposed two RDPNNs have a low-dimensional state space and low model complexity. Under the condition that the Hessian matrix of the associated Lagrangian function is positive semi-definite and positive definite at each Karush–Kuhn–Tucker point, the proposed two RDPNNs are proven to be globally stable in the sense of Lyapunov and converge globally to a point satisfying the reduced optimality condition of NP. Therefore, the proposed two RDPNNs are theoretically guaranteed to solve convex NP problems and a class of nonconvex NP problems. Computed results show that the proposed two RDPNNs have a faster computation speed than the existing projection neural networks for solving NP problems.

[1]  Mauro Forti,et al.  Convergence of Neural Networks for Programming Problems via a Nonsmooth Łojasiewicz Inequality , 2006, IEEE Transactions on Neural Networks.

[2]  Long Cheng,et al.  Recurrent Neural Network for Non-Smooth Convex Optimization Problems With Application to the Identification of Genetic Regulatory Networks , 2011, IEEE Transactions on Neural Networks.

[3]  Mohamed S. Kamel,et al.  A Cooperative Recurrent Neural Network for Solving L1 Estimation Problems with General Linear Constraints , 2008, Neural Computation.

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

[5]  Xingbao Gao,et al.  A Novel Neural Network for Generally Constrained Variational Inequalities , 2017, IEEE Transactions on Neural Networks and Learning Systems.

[6]  Yousheng Xia,et al.  New cooperative projection neural network for nonlinearly constrained variational inequality , 2009, Science in China Series F: Information Sciences.

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

[8]  Li-Zhi Liao,et al.  A New Projection-Based Neural Network for Constrained Variational Inequalities , 2009, IEEE Transactions on Neural Networks.

[9]  Qingshan Liu,et al.  A One-Layer Projection Neural Network for Nonsmooth Optimization Subject to Linear Equalities and Bound Constraints , 2013, IEEE Transactions on Neural Networks and Learning Systems.

[10]  Jun Wang,et al.  A Bi-Projection Neural Network for Solving Constrained Quadratic Optimization Problems , 2016, IEEE Transactions on Neural Networks and Learning Systems.

[11]  Xiaolin Hu,et al.  Design of Recurrent Neural Networks for Solving Constrained Least Absolute Deviation Problems , 2010, IEEE Transactions on Neural Networks.

[12]  Stephen P. Boyd,et al.  Disciplined Convex Programming , 2006 .

[13]  Jun Wang,et al.  A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations , 2004, Neural Networks.

[14]  Youshen Xia,et al.  A recurrent neural network for nonlinear convex optimization subject to nonlinear inequality constraints , 2004, IEEE Trans. Circuits Syst. I Regul. Pap..

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

[16]  Jinde Cao,et al.  A high performance neural network for solving nonlinear programming problems with hybrid constraints , 2001 .

[17]  Jun Wang,et al.  A Novel Recurrent Neural Network for Solving Nonlinear Optimization Problems With Inequality Constraints , 2008, IEEE Transactions on Neural Networks.

[18]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[19]  Wei Xing Zheng,et al.  Discrete-Time Neural Network for Fast Solving Large Linear $L_{1}$ Estimation Problems and its Application to Image Restoration , 2012, IEEE Transactions on Neural Networks and Learning Systems.

[20]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[21]  Youshen Xia,et al.  A Cooperative Projection Neural Network for Fast Solving Linear Reconstruction Problems , 2017, ISNN.

[22]  Andrzej Cichocki,et al.  Neural networks for optimization and signal processing , 1993 .

[23]  Sitian Qin,et al.  A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Problems With Equality and Inequality Constraints , 2017, IEEE Transactions on Cybernetics.

[24]  Gang Feng,et al.  A neural network for robust LCMP beamforming , 2006, Signal Process..

[25]  Jun Wang,et al.  A recurrent neural network for solving nonlinear convex programs subject to linear constraints , 2005, IEEE Transactions on Neural Networks.

[26]  Youshen Xia,et al.  An Extended Projection Neural Network for Constrained Optimization , 2004, Neural Computation.

[27]  Mauro Forti,et al.  Generalized neural network for nonsmooth nonlinear programming problems , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[28]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms, 3/E. , 2019 .

[29]  Jinde Cao,et al.  A new neural network for solving quadratic programming problems with equality and inequality constraints , 2014, Math. Comput. Simul..

[30]  Sohrab Effati,et al.  A Neurodynamic Model to Solve Nonlinear Pseudo-Monotone Projection Equation and Its Applications , 2017, IEEE Transactions on Cybernetics.

[31]  J. T. Spooner,et al.  Adaptive and Learning Systems for Signal Processing, Communications, and Control , 2006 .

[32]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .