A modified hopfield network for nonlinear programming problem solving

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an efficient approach based on Hopfield network for solving nonlinear optimization problems, with polynomial objective function, polynomial equality constraints and polynomial inequality constraints. A modified Hopfield network is developed and its stability and convergence is analyzed in the paper. Then a mapping of nonlinear optimization problems is formulated using the modified Hopfield network. Simulation results are provided to demonstrate the performance of the proposed neural network. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Yu, C., & Luo, Y. (2007). A modified hopfield network for nonlinear programming problem solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4493 LNCS, pp. 302–310). Springer Verlag. https://doi.org/10.1007/978-3-540-72395-0_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free