Solving nonlinear complementarity problems with neural networks: A reformulation method approach

Journal of Computational and Applied Mathematics

Volumn 131, Issue 1-2, 2001, Pages 343-359

  Liao, Li Zhi ^a   Qi, Houduo ^b   Qi, Liqun ^b  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Neural network; Nonlinear complementarity problem; Reformulation; Stability

Indexed keywords

ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; LYAPUNOV METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

NONLINEAR COMPLIMENTARY PROBLEMS;

NEURAL NETWORKS;

NEURAL NETWORK;

EID: 0035361448     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00262-4     Document Type: Article

References (35)

1. Neural network for quadratic optimization with bound constraints
2. A penalized Fischer-Burmeister NCP function: Theoretical investigation and numerical results
3. Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
4. Solving convex programming problems with equality constraints by neural networks
5. Nonlinear programming without computation
6. A new neural network for solving linear programming problems
7. A semismooth equation approach to the solution of nonlinear complementarity problems
8. On the accurate identification of active constraints
9. A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
10. A new merit function for nonlinear complementarity problems and a related algorithm
11. Engineering and economic applications of complementarity problems
12. A special Newton-type optimization method
13. An NCP-function and its use for the solution of complementarity problems
14. Reformulation
15. On the resolution of monotone complementarity problems
16. Neural computation of decisions in optimization problems
17. A new nonsmooth equation approach to nonlinear complementarity problems
18. Neural network for nonlinear programming
19. 1 equations
20. A neural network for the linear complementarity problem
21. On solving constrained optimization problems with neural networks: A penalty method approach
22. Nonsmooth equations: Motivation and algorithms
23. Convergence analysis of some algorithms for solving nonsmooth equations
24. Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems
25. Semismooth Karush-Kuhn-Tucker equations and convergence analysis of Newton and quasi-Newton methods for solving these equations
26. A nonsmooth version of Newton's method
27. Nonlinear switched-capacitor 'neural' networks for optimization problems
28. On NCP functions
29. Solving the nonlinear complementarity problem by a homotopy method
30. Modified Newton methods for solving semismooth reformulations of monotone complementarity problems
31. Solving linear programming problems with neural networks: A comparative study