2022 12th International Conference on Information Science and Technology (ICIST)最新文献

筛选
英文 中文
A Neurodynamic Approach for a Class of Convex-concave Minimax Problems 一类凸凹极大极小问题的神经动力学方法
2022 12th International Conference on Information Science and Technology (ICIST) Pub Date : 2022-10-14 DOI: 10.1109/ICIST55546.2022.9926965
Zehua Xie, Xinrui Jiang, Sitian Qin, Jiqiang Feng, Shengbing Xu
{"title":"A Neurodynamic Approach for a Class of Convex-concave Minimax Problems","authors":"Zehua Xie, Xinrui Jiang, Sitian Qin, Jiqiang Feng, Shengbing Xu","doi":"10.1109/ICIST55546.2022.9926965","DOIUrl":"https://doi.org/10.1109/ICIST55546.2022.9926965","url":null,"abstract":"This paper presents a neurodynamic approach for a class of convex-concave minimax problems. First, variational inequalities are given, serving as the necessary and sufficient conditions for the desired saddle point of the underlying objective function. Next, based on the variational inequalities, a neurodynamic approach is designed for the minimax problems. Taking advantage of a proper Lyapunov function, the stability of the state solution of the proposed neurodynamic approach is guaranteed. Furthermore, the proposed neurodynamic approach is able to solve the non-quadratic convex-concave minimax problem exponentially. Compared with the existing researches for the quadratic minimax problem, the proposed neurodynamic approach has wider scope of applications to some extent. Finally, a numerical experiment is provided to show the effectiveness of the proposed neurodynamic approach.","PeriodicalId":211213,"journal":{"name":"2022 12th International Conference on Information Science and Technology (ICIST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126091182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A New and More Challenging Compositive Multi-Task Optimization Problem Test Suite 一个新的更具挑战性的综合多任务优化问题测试套件
2022 12th International Conference on Information Science and Technology (ICIST) Pub Date : 2022-10-14 DOI: 10.1109/ICIST55546.2022.9926808
Yiyi Jiang, Zhi-hui Zhan, Jinchao Zhang
{"title":"A New and More Challenging Compositive Multi-Task Optimization Problem Test Suite","authors":"Yiyi Jiang, Zhi-hui Zhan, Jinchao Zhang","doi":"10.1109/ICIST55546.2022.9926808","DOIUrl":"https://doi.org/10.1109/ICIST55546.2022.9926808","url":null,"abstract":"Evolutionary multi-task optimization (EMTO) is a recently emerging topic in the research area of evolutionary computation, aiming at solving multiple different optimization tasks simultaneously. Recently, with the development of EMTO, many multi-task optimization problem (MTOP) benchmark test suites have been proposed. However, these MTOP test suites are not sufficiently challenging. That is, the tasks in these MTOPs always have the same dimensionality and the aligned dimensions of the tasks can have related physical meanings or similar optimal values. To address these disadvantages of existing MTOP test suites, we propose a new and more challenging compositive MTOP (cMTOP) test suite. There are ten cMTOP instances in this test suite and each instance contains two tasks. These cMTOP instances are more challenging with three properties. First, the tasks in each cMTOP have different numbers of dimensions. Second, to make the aligned dimensions of two tasks have irrelated physical meanings, each task is a composition function composed of several basic functions. Third, each task in cMTOP is shifted and rotated to make the aligned dimensions of the two tasks have different optimal values. Based on these properties, the proposed cMTOP test suite is more challenging and can better evaluate the performance of EMTO algorithms. Finally, we analyze the performance of several state-of-the-art EMTO algorithms on this new and challenging cMTOP test suite.","PeriodicalId":211213,"journal":{"name":"2022 12th International Conference on Information Science and Technology (ICIST)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114935280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信