Design of General Projection Neural Networks for Solving Monotone Linear Variational Inequalities and Linear and Quadratic Optimization Problems

Most existing neural networks for solving linear variational inequalities (LVIs) with the mapping Mx + p require positive definiteness (or positive semidefiniteness) of M. In this correspondence, it is revealed that this condition is sufficient but not necessary for an LVI being strictly monotone (or monotone) on its constrained set where equality constraints are present. Then, it is proposed to reformulate monotone LVIs with equality constraints into LVIs with inequality constraints only, which are then possible to be solved by using some existing neural networks. General projection neural networks are designed in this correspondence for solving the transformed LVIs. Compared with existing neural networks, the designed neural networks feature lower model complexity. Moreover, the neural networks are guaranteed to be globally convergent to solutions of the LVI under the condition that the linear mapping Mx + p is monotone on the constrained set. Because quadratic and linear programming problems are special cases of LVI in terms of solutions, the designed neural networks can solve them efficiently as well. In addition, it is discovered that the designed neural network in a specific case turns out to be the primal-dual network for solving quadratic or linear programming problems. The effectiveness of the neural networks is illustrated by several numerical examples.

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

[2]  Kwong-Sak Leung,et al.  A new gradient-based neural network for solving linear and quadratic programming problems , 2001, IEEE Trans. Neural Networks.

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

[4]  Youshen Xia,et al.  A new neural network for solving linear and quadratic programming problems , 1996, IEEE Trans. Neural Networks.

[5]  Xue-Bin Liang,et al.  Global exponential stability of neural networks with globally Lipschitz continuous activations and its application to linear variational inequality problem , 2001, IEEE Trans. Neural Networks.

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

[7]  Jinde Cao,et al.  A simple and high performance neural network for quadratic programming problems , 2001, Appl. Math. Comput..

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

[9]  Gang Feng,et al.  On Convergence Conditions of an Extended Projection Neural Network , 2005, Neural Computation.

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

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

[12]  J. Pang,et al.  On a Generalization of a Normal Map and Equation , 1995 .

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

[14]  Bingsheng He,et al.  A neural network model for monotone linear asymmetric variational inequalities , 2000, IEEE Trans. Neural Networks Learn. Syst..

[15]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[16]  Bingsheng He,et al.  A new method for a class of linear variational inequalities , 1994, Math. Program..

[17]  Liqun Qi,et al.  A novel neural network for variational inequalities with linear and nonlinear constraints , 2005, IEEE Transactions on Neural Networks.

[18]  Xiaolin Hu,et al.  Solving Generally Constrained Generalized Linear Variational Inequalities Using the General Projection Neural Networks , 2007, IEEE Transactions on Neural Networks.

[19]  Shubao Liu,et al.  A Simplified Dual Neural Network for Quadratic Programming With Its KWTA Application , 2006, IEEE Transactions on Neural Networks.

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

[21]  J. Hopfield,et al.  Computing with neural circuits: a model. , 1986, Science.

[22]  Jinde Cao,et al.  A delayed neural network for solving linear projection equations and its analysis , 2005, IEEE Transactions on Neural Networks.

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

[24]  Xiaolin Hu,et al.  A Recurrent Neural Network for Solving a Class of General Variational Inequalities , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[26]  Patrick T. Harker,et al.  Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications , 1990, Math. Program..

[27]  Y. Xia,et al.  Further Results on Global Convergence and Stability of Globally Projected Dynamical Systems , 2004 .

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

[29]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .