Solving nonlinear complementarity problems with neural networks: A reformulation method approach
From MaRDI portal
Publication:5939878
DOI10.1016/S0377-0427(00)00262-4zbMath0985.65072OpenAlexW2019584702MaRDI QIDQ5939878
Hou-Duo Qi, Li-Zhi Liao, Liqun Qi
Publication date: 27 May 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00262-4
convergenceexponential stabilityneural networkasymptotic stabilityunconstrained minimizationnonlinear complementarity problems
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (21)
A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems ⋮ Neural network approaches based on new NCP-functions for solving tensor complementarity problem ⋮ A NEURAL NETWORK FOR THE GENERALIZED NONLINEAR COMPLEMENTARITY PROBLEM OVER A POLYHEDRAL CONE ⋮ Convergence analysis of a differential equation approach for solving nonlinear programming problems ⋮ Global uniqueness and solvability of tensor complementarity problems for \(\mathcal{H}_+\)-tensors ⋮ A dynamical neural network approach for solving stochastic two-player zero-sum games ⋮ Neural networks for solving second-order cone constrained variational inequality problem ⋮ A dynamic system model for solving convex nonlinear optimization problems ⋮ A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium ⋮ A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints ⋮ A novel neural network for solving semidefinite programming problems with some applications ⋮ A dynamical model for solving degenerate quadratic minimax problems with constraints ⋮ A novel neural network model for solving a class of nonlinear semidefinite programming problems ⋮ Neural network based on systematically generated smoothing functions for absolute value equation ⋮ A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems ⋮ A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints ⋮ Modified gradient dynamic approach to the tensor complementarity problem ⋮ Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions ⋮ A new class of neural networks for NCPs using smooth perturbations of the natural residual function ⋮ An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function ⋮ A neural network for monotone variational inequalities with linear constraints
Cites Work
- ``Neural computation of decisions in optimization problems
- Solving convex programming problems with equality constaints by neural networks
- A new neural network for solving linear programming problems
- On NCP-functions
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A penalized Fischer-Burmeister NCP-function
- A neural network for the linear complementarity problem
- On the resolution of monotone complementarity problems
- A nonsmooth version of Newton's method
- Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- Nonsmooth Equations: Motivation and Algorithms
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- On the Accurate Identification of Active Constraints
- A special newton-type optimization method
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Engineering and Economic Applications of Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Mathematical control theory: an introduction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving nonlinear complementarity problems with neural networks: A reformulation method approach
