A simple and high performance neural network for quadratic programming problems.

DOI10.1016/S0096-3003(00)00097-7zbMath1162.90532OpenAlexW2071677966MaRDI QIDQ1855089

Demin Sun, Qing Tao, Cao, Jinde

Publication date: 28 January 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(00)00097-7

zbMATH Keywords

Neural networksGlobal convergenceConstraint gradientFeasible solutionQuadratic programming problems

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A discrete-time projection neural network for solving degenerate convex quadratic optimization ⋮ A capable neural network model for solving the maximum flow problem ⋮ A nonlinear projection neural network for solving interval quadratic programming problems and its stability analysis ⋮ A dynamic genetic algorithm based on continuous neural networks for a kind of non-convex optimization problems. ⋮ A feedback neural network for solving convex constraint optimization problems ⋮ A new delayed projection neural network for solving quadratic programming problems subject to linear constraints ⋮ Numerical solutions for constrained quadratic problems using high-performance neural networks ⋮ The BSB neural network in the convex body spanned by the prototype patterns for associative memory

Cites Work

• Critical point theory and Hamiltonian systems
• An approach to nonlinear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple and high performance neural network for quadratic programming problems.