Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints
DOI10.1016/J.PHYSLETA.2009.03.011zbMath1229.92008OpenAlexW2094206629MaRDI QIDQ653080
Publication date: 6 January 2012
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physleta.2009.03.011
global convergencequadratic programmingrecurrent neural networkstime-varyinggradient-based neural network (GNN)
Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items (29)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Emergence of unstable itinerant orbits in a recurrent neural network model
- Log-det approximation based on uniformly distributed seeds and its application to Gaussian process regression
- A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
- Exploiting Hessian matrix and trust-region algorithm in hyperparameters estimation of Gaussian process
- O(N2)-Operation Approximation of Covariance Matrix Inverse in Gaussian Process Regression Based on Quasi-Newton BFGS Method
- Numerical Optimization
This page was built for publication: Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints