In this paper, a neurodynamic model is given to solve nonlinear pseudo-monotone projection equation. Under pseudo-monotonicity condition and Lipschitz continuous condition, the projection neurodynamic model is proved to be stable in the sense of Lyapunov, globally convergent, globally asymptotically stable, and globally exponentially stable. Also, we show that, our new neurodynamic model is effective to solve the nonconvex optimization problems. Moreover, since monotonicity is a special case of pseudo-monotonicity and also since a co-coercive mapping is Lipschitz continuous and monotone, and a strongly pseudo-monotone mapping is pseudo-monotone, the neurodynamic model can be applied to solve a broader classes of constrained optimization problems related to variational inequalities, pseudo-convex optimization problem, linear and nonlinear complementarity problems, and linear and convex quadratic programming problems. Finally, several illustrative examples are stated to demonstrate the effectiveness and efficiency of our new neurodynamic model.
We study the maximum flow problem (MFP) employing the concepts of Recurrent Neural Networks (RNN)s. The aim of the present attempt is to find a solution for MFP utilizing projection RNN models based on mixed linear complementarity problem (MLCP). The Karush–Kuhn–Tucker (KKT) optimality conditions of the original problem are applied to develop the projection RNN model based on MLCP. Besides, the Lyapunov stability and the global convergence of the projection RNN model are proved. Finally, several illustrative examples are given to demonstrate the performance of this approach. The obtained results are compared with previous approaches to solving MFP.