A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS

DOI10.1142/S0217595911003223zbMath1233.90261MaRDI QIDQ3174017

Masumeh Abbasi, Sohrab Effati, A. Ghomashi

Publication date: 11 October 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595911003223

zbMATH Keywords

stability; global convergence; linear programming; quadratic programming; dynamical system; mixed linear complementarity problem; NCP functions

Mathematics Subject Classification ID

90C22: Semidefinite programming

90C59: Approximation methods and heuristics in mathematical programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function, An inverse-free dynamical system for solving the absolute value equations

Cites Work

• Unnamed Item
• A deterministic annealing neural network for convex programming
• On the stability of globally projected dynamical systems
• Nonlinear complementarity as unconstrained optimization
• Application of projection neural network in solving convex programming problems
• Lagrange programming neural networks
• Mathematical Programming in Neural Networks
• A special newton-type optimization method
• On convergence rate of projection neural networks
• Mathematical control theory: an introduction