具有非光滑扫频集的受控扫频过程的数值方法

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Chadi Nour, Vera Zeidan
{"title":"具有非光滑扫频集的受控扫频过程的数值方法","authors":"Chadi Nour, Vera Zeidan","doi":"10.1007/s10957-024-02470-x","DOIUrl":null,"url":null,"abstract":"<p>The numerical method developed in Nour and Zeidan (IEEE Control Syst. Lett. 6:1190-1195, 2022) via the exponential penalization technique for optimal control problems involving sweeping processes with sweeping set <i>C</i> generated by <i>one</i> <i>smooth</i> function, is generalized in this paper to the case where <i>C</i> is <i>nonsmooth</i>. That is, <i>C</i> is the intersection of a <i>finite number</i> (greater than one) of sublevel sets of smooth functions. The change from one to greater than one generating smooth functions is quite challenging. Indeed, while in the latter case <i>C</i> could be reformulated as being generated by one function, however, this function is only <i>Lipschitz</i>, and hence, the method established for one generating smooth function is not applicable to this framework. Therefore, this general setting requires a new approach, which represents the novelty of this paper.</p>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Numerical Method for a Controlled Sweeping Process with Nonsmooth Sweeping Set\",\"authors\":\"Chadi Nour, Vera Zeidan\",\"doi\":\"10.1007/s10957-024-02470-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The numerical method developed in Nour and Zeidan (IEEE Control Syst. Lett. 6:1190-1195, 2022) via the exponential penalization technique for optimal control problems involving sweeping processes with sweeping set <i>C</i> generated by <i>one</i> <i>smooth</i> function, is generalized in this paper to the case where <i>C</i> is <i>nonsmooth</i>. That is, <i>C</i> is the intersection of a <i>finite number</i> (greater than one) of sublevel sets of smooth functions. The change from one to greater than one generating smooth functions is quite challenging. Indeed, while in the latter case <i>C</i> could be reformulated as being generated by one function, however, this function is only <i>Lipschitz</i>, and hence, the method established for one generating smooth function is not applicable to this framework. Therefore, this general setting requires a new approach, which represents the novelty of this paper.</p>\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2024-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10957-024-02470-x\",\"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.1007/s10957-024-02470-x","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

本文将 Nour 和 Zeidan(IEEE Control Syst. Lett.也就是说,C 是有限个(大于一个)平滑函数子级集的交集。从生成一个平滑函数到大于一个平滑函数的变化相当具有挑战性。事实上,虽然在后一种情况下,C 可以重新表述为由一个函数生成,但是,这个函数只是 Lipschitz 函数,因此,为一个生成平滑函数建立的方法不适用于这个框架。因此,这种一般情况需要一种新的方法,这就是本文的新颖之处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Numerical Method for a Controlled Sweeping Process with Nonsmooth Sweeping Set

Numerical Method for a Controlled Sweeping Process with Nonsmooth Sweeping Set

The numerical method developed in Nour and Zeidan (IEEE Control Syst. Lett. 6:1190-1195, 2022) via the exponential penalization technique for optimal control problems involving sweeping processes with sweeping set C generated by one smooth function, is generalized in this paper to the case where C is nonsmooth. That is, C is the intersection of a finite number (greater than one) of sublevel sets of smooth functions. The change from one to greater than one generating smooth functions is quite challenging. Indeed, while in the latter case C could be reformulated as being generated by one function, however, this function is only Lipschitz, and hence, the method established for one generating smooth function is not applicable to this framework. Therefore, this general setting requires a new approach, which represents the novelty of this paper.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信