Hopfield网络上二次泛函的最小化

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Equations O. Boichuk, D. Bihun, V. Feruk, O. Pokutnyi
{"title":"Hopfield网络上二次泛函的最小化","authors":"\t\tEquations\t\t\tO. Boichuk, D. Bihun, V. Feruk, O. Pokutnyi","doi":"10.14232/ejqtde.2021.1.92","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the continuous Hopfield model with a weak interaction of network neurons. This model is described by a system of differential equations with linear boundary conditions. Also, we consider the questions of finding necessary and sufficient conditions of solvability and constructive construction of solutions of the given problem, which turn into solutions of the linear generating problem, as the parameter $\\varepsilon$ tends to zero. An iterative algorithm for finding solutions has been constructed. The problem of finding the extremum of the target functions on the given problem solution is considered. To minimize a functional, an accelerated method of conjugate gradients is used. Results are illustrated with examples for the case of three neurons.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Minimizing of the quadratic functional on Hopfield networks\",\"authors\":\"\\t\\tEquations\\t\\t\\tO. Boichuk, D. Bihun, V. Feruk, O. Pokutnyi\",\"doi\":\"10.14232/ejqtde.2021.1.92\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the continuous Hopfield model with a weak interaction of network neurons. This model is described by a system of differential equations with linear boundary conditions. Also, we consider the questions of finding necessary and sufficient conditions of solvability and constructive construction of solutions of the given problem, which turn into solutions of the linear generating problem, as the parameter $\\\\varepsilon$ tends to zero. An iterative algorithm for finding solutions has been constructed. The problem of finding the extremum of the target functions on the given problem solution is considered. To minimize a functional, an accelerated method of conjugate gradients is used. Results are illustrated with examples for the case of three neurons.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.14232/ejqtde.2021.1.92\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.14232/ejqtde.2021.1.92","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 2

摘要

本文考虑具有弱相互作用的连续Hopfield模型。该模型用具有线性边界条件的微分方程组来描述。此外,我们还考虑了当参数$\varepsilon$趋于零时,给定问题解的可解性和构造性的充分必要条件的求取问题,这些解转化为线性生成问题的解。构造了一种求解的迭代算法。考虑在给定问题解上求目标函数的极值问题。为了最小化泛函,使用了加速共轭梯度法。用三个神经元的例子说明了结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Minimizing of the quadratic functional on Hopfield networks
In this paper, we consider the continuous Hopfield model with a weak interaction of network neurons. This model is described by a system of differential equations with linear boundary conditions. Also, we consider the questions of finding necessary and sufficient conditions of solvability and constructive construction of solutions of the given problem, which turn into solutions of the linear generating problem, as the parameter $\varepsilon$ tends to zero. An iterative algorithm for finding solutions has been constructed. The problem of finding the extremum of the target functions on the given problem solution is considered. To minimize a functional, an accelerated method of conjugate gradients is used. Results are illustrated with examples for the case of three neurons.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信