A novel neural dynamical approach to convex quadratic program and its efficient applications
From MaRDI portal
Publication:1784530
DOI10.1016/j.neunet.2009.03.020zbMath1411.90253OpenAlexW2085871808WikidataQ51834396 ScholiaQ51834396MaRDI QIDQ1784530
Publication date: 27 September 2018
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2009.03.020
convex quadratic programlow computational complexitylarge computational step lengthneural dynamical approach
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)
Related Items (7)
Locality preserving score for joint feature weights learning ⋮ Fixed-time adaptive tracking control of two moving targets for a class of non-linear multi-agent systems ⋮ Single-state distributed \(k\)-winners-take-all neural network model ⋮ Feature selection and multi-kernel learning for sparse representation on a manifold ⋮ Synchronization of stochastic fuzzy cellular neural networks with leakage delay based on adaptive control ⋮ Analysis and design of a distributed \(k\)-winners-take-all model ⋮ Solving time-varying nonlinear inequalities using continuous and discrete-time Zhang dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neurodynamical optimization
- A continuous method for convex programming problems
- An exterior Newton method for strictly convex quadratic programming
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- Stable computational dynamics for a class of circuits with O(N) interconnections capable of KWTA and rank extractions
- Modified Projection-Type Methods for Monotone Variational Inequalities
- An Extended Projection Neural Network for Constrained Optimization
This page was built for publication: A novel neural dynamical approach to convex quadratic program and its efficient applications