A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
From MaRDI portal
Publication:1600289
DOI10.1016/S0375-9601(02)00424-3zbMath0995.65063MaRDI QIDQ1600289
Publication date: 12 June 2002
Published in: Physics Letters. A (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
68T05: Learning and adaptive systems in artificial intelligence
Related Items
A One-Layer Recurrent Neural Network with a Discontinuous Activation Function for Linear Programming, Complex-valued Zhang neural network for online complex-valued time-varying matrix inversion, Finite termination of a Newton-type algorithm for a class of affine variational inequality problems, Zhang neural network solving for time-varying full-rank matrix Moore-Penrose inverse, Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints, Equivalence of velocity-level and acceleration-level redundancy-resolution of manipulators, A feedback neural network for solving convex constraint optimization problems, Bi-criteria optimal control of redundant robot manipulators using LVI-based primal-dual neural network, On global exponential stability of standard and full‐range CNNs
Cites Work
- A deterministic annealing neural network for convex programming
- Lagrange programming neural networks
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- Global asymptotic and exponential stability of a dynamic neural system with asymmetric connection weights
- On a Generalization of a Normal Map and Equation
- A high performance neural network for solving nonlinear programming problems with hybrid constraints
- Unnamed Item
- Unnamed Item
