A neural network model for monotone linear asymmetric variational inequalities

Linear variational inequality is a uniform approach for some important problems in optimization and equilibrium problems. In this paper, we give a neural-network model for solving asymmetric linear variational inequalities. The model is based on a simple projection and contraction method. Computer simulation is performed for linear programming (LP) and linear complementarity problems (LCP). The test results for LP problem demonstrate that our model converges significantly faster than the three existing neural-network models examined in a recent comparative study paper.

[1]  B. He.  A class of projection and contraction methods for monotone variational inequalities , 1997 .

[2]  Turgut M. Ozan.  Applied mathematical programming for production and engineering management , 1986 .

[3]  Bin-Xin He.  Solving a class of linear projection equations , 1994 .

[4]  G. M. Korpelevich.  The extragradient method for finding saddle points and other problems , 1976 .

[5]  Stefen Hui,et al.  Solving linear programming problems with neural networks: a comparative study , 1995, IEEE Trans. Neural Networks.

[6]  A. Nagurney,et al.  Projected Dynamical Systems and Variational Inequalities with Applications , 1995 .

[7]  Katta G. Murty,et al.  Linear complementarity, linear and nonlinear programming , 1988 .

[8]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

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

[10]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[11]  Jong-Shi Pang,et al.  Error bounds in mathematical programming , 1997, Math. Program..

[12]  Bingsheng He,et al.  A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming , 1992 .

[13]  A. Cichocki,et al.  Neural networks for solving systems of linear equations and related problems , 1992 .

[14]  A. Balakrishnan,et al.  Methods of optimization , 1988 .

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

[16]  P. Tseng,et al.  Modified Projection-Type Methods for Monotone Variational Inequalities , 1996 .

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

[18]  Boris Polyak,et al.  Constrained minimization methods , 1966 .

[19]  E. Polak,et al.  Constrained Minimization Problems in Finite-Dimensional Spaces , 1966 .

[20]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[21]  A. Goldstein.  Convex programming in Hilbert space , 1964 .

[22]  E. Khobotov.  Modification of the extra-gradient method for solving variational inequalities and certain optimization problems , 1989 .

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

[24]  Michael A. Shanblatt,et al.  Linear and quadratic programming neural network analysis , 1992, IEEE Trans. Neural Networks.

[25]  B. Curtis Eaves,et al.  On the basic theorem of complementarity , 1971, Math. Program..

[26]  Masao Fukushima,et al.  Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems , 1992, Math. Program..