Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Park, J.
Right arrow Articles by Park, D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Park, J.
Right arrow Articles by Park, D.
(Neural Computation. 1999;11:1985-1994.)
© 1999 The MIT Press


Letter

On the Design of BSB Neural Associative Memories Using Semidefinite Programming

Jooyoung Park

Department of Control and Instrumentation Engineering, Korea University, Chochiwon, Chungnam, 339-800, Korea

Hyuk Cho

Department of Computer Science, Korea University, Chochiwon, Chungnam, 339-800, Korea

Daihee Park

Department of Computer Science, Korea University, Chochiwon, Chungnam, 339-800, Korea

This article is concerned with the reliable search for optimally performing BSB (brain state in a box) neural associative memories given a set of prototype patterns to be stored as stable equilibrium points. By converting and/or modifying the nonlinear constraints of a known formulation for the synthesis of BSB-based associative memories into linear matrix inequalities, we recast the synthesis into semidefinite programming problems and solve them by recently developed interior point methods. The validity of this approach is illustrated by a design example.




This article has been cited by other articles:


Home page
Neural Comput.Home page
Z. Zeng and J. Wang
Analysis and design of associative memories based on recurrent neural networks with linear saturation activation functions and time-varying delays.
Neural Comput., August 1, 2007; 19(8): 2149 - 2182.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
J. Síma, P. Orponen, and T. Antti-Poika
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets
Neural Comput., December 1, 2000; 12(12): 2965 - 2989.
[Abstract] [Full Text]


Home page
Neural Comput.Home page
J. Park and Y. Park
An Optimization Approach to Design of Generalized BSB Neural Associative Memories
Neural Comput., June 1, 2000; 12(6): 1449 - 1462.
[Abstract] [Full Text]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1999 by The MIT Press.