A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints
From MaRDI portal
Publication:508218
DOI10.1016/j.chaos.2016.03.009zbMath1355.90066OpenAlexW2298471421MaRDI QIDQ508218
Publication date: 10 February 2017
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2016.03.009
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further results on global convergence and stability of globally projected dynamical systes
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- A deterministic annealing neural network for convex programming
- On the stability of globally projected dynamical systems
- Solving complementarity and variational inequalities problems using neural networks
- Numerical solutions for constrained quadratic problems using high-performance neural networks
- Lagrange programming neural networks
- Analysis and design of a recurrent neural network for linear programming
- On saddle points and optima for non-smooth and non-convex programs
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- An Extended Projection Neural Network for Constrained Optimization
- A projection neural network and its application to constrained optimization problems
- A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming
- A high performance neural network for solving nonlinear programming problems with hybrid constraints
This page was built for publication: A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints
