A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems
From MaRDI portal
Publication:1631447
DOI10.1016/j.cam.2018.08.030zbMath1403.90623OpenAlexW2889351970MaRDI QIDQ1631447
Publication date: 6 December 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.08.030
stabilityvariational inequalitiesneural networksecond-order cone programmingconvergentgradient based
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Artificial intelligence (68T99)
Related Items
An Implementable Augmented Lagrangian Method for Solving Second-Order Cone Constrained Variational Inequalities, An accelerated ZNN-based algorithm with piecewise time-varying parameters to solve time-variant linear equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neural networks for solving second-order cone constrained variational inequality problem
- A dynamic system model for solving convex nonlinear optimization problems
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
- Mean square global asymptotic stability of stochastic recurrent neural networks with distributed delays
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- A feedback neural network for solving convex constraint optimization problems
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Nonlinear systems. Analysis, stability, and control
- An infeasible-interior-point algorithm for linear complementarity problems
- Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
- Neural networks for nonlinear and mixed complementarity problems and their applications
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
- Globally robust stability analysis for stochastic Cohen-Grossberg neural networks with impulse control and time-varying delays
- Neural network models and its application for solving linear and quadratic programming problems
- Application of projection neural network in solving convex programming problems
- Solving complementarity and variational inequalities problems using neural networks
- Solving asymmetric variational inequalities via convex optimization
- On some non-linear elliptic differential functional equations
- Lectures on Modern Convex Optimization
- Three-dimensional quasi-static frictional contact by using second-order cone linear complementarity problem
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A projection neural network and its application to constrained optimization problems
- Mean square exponential stability of stochastic delay cellular neural networks
- Variational inequalities
- Convex programming and variational inequalities
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach
- Stability analysis of gradient-based neural networks for optimization problems
