Close category search window
 

Solving quadratic programming problems with linear Hopfield networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dudnikov, E. ; Int. Res. Inst. for Manage. Sci., Moscow, Russia

We consider a linear Hopfield network for solving quadratic programming problems with equation constraints. The problem is reduced to the solution of ordinary linear differential equations with arbitrary square matrix. Because of some properties of this matrix special methods are required for good convergence of the system. After some comparative studies of neural network models for solving this problem we suggest a modified system with doubling of the number of variables. The new system is very simple in implementation on the linear Hopfield network and demonstrates sufficiently good convergence to the solution

Published in:
Neural Networks, 2001. Proceedings. IJCNN '01. International Joint Conference on  (Volume:1 )

Date of Conference: 2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.