By Topic

Convergence analysis of neural networks that solve linear programming problems

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

3 Author(s)
Ferreira, L.V. ; Dept. of Electr. Eng., Univ. Fed. do Rio de Janeiro, Brazil ; Kaszkurewicz, E. ; Bhaya, A.

Artificial neural networks for solving different variants of linear programming problems are proposed and analyzed by the Lyapunov direct method. An energy function with an exact penalty term is associated with each variant and leads to a discontinuous dynamic gradient system model of an artificial neural network. The objective is to derive conditions that the network gains must satisfy in order to ensure convergence to the solution set of the linear programming problems. This objective is attained by representing the neural networks in a Persidskii-type form (S.K. Persidskii, 1969) and using an associated diagonal-type Lyapunov function

Published in:

Neural Networks, 2002. IJCNN '02. Proceedings of the 2002 International Joint Conference on  (Volume:3 )

Date of Conference:

2002