基于强制极值搜索的搜索识别算法

Q4 Mathematics
A. Mikhalev, L. V. Korol
{"title":"基于强制极值搜索的搜索识别算法","authors":"A. Mikhalev, L. V. Korol","doi":"10.15421/247732","DOIUrl":null,"url":null,"abstract":"We provide one of possible ways to reduce the time of transitive process of models tuning in the identification problems, which is: forced search for extremum of system state criterion.","PeriodicalId":52827,"journal":{"name":"Researches in Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithm of search identification with forced search for extremum\",\"authors\":\"A. Mikhalev, L. V. Korol\",\"doi\":\"10.15421/247732\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We provide one of possible ways to reduce the time of transitive process of models tuning in the identification problems, which is: forced search for extremum of system state criterion.\",\"PeriodicalId\":52827,\"journal\":{\"name\":\"Researches in Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Researches in Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15421/247732\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Researches in Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15421/247732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种减少辨识问题中模型调优传递过程时间的方法,即系统状态准则的强制极值搜索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Algorithm of search identification with forced search for extremum
We provide one of possible ways to reduce the time of transitive process of models tuning in the identification problems, which is: forced search for extremum of system state criterion.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.50
自引率
0.00%
发文量
8
审稿时长
16 weeks
×
引用
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学术官方微信