Optimal control for coupled sweeping processes under minimal assumptions

Samara Chamoun, Vera Zeidan
{"title":"Optimal control for coupled sweeping processes under minimal assumptions","authors":"Samara Chamoun, Vera Zeidan","doi":"arxiv-2409.07722","DOIUrl":null,"url":null,"abstract":"In this paper, the study of nonsmooth optimal control problems (P) involving\na controlled sweeping process with three main characteristics is launched.\nFirst, the sweeping sets C(t) are nonsmooth, unbounded, time-dependent,\nuniformly prox-regular, and satisfy minimal assumptions. Second, the sweeping\nprocess is coupled with a controlled differential equation. Third, joint-state\nendpoints constraint set S, including periodic conditions, is present. The\nexistence and uniqueness of a Lipschitz solution for our dynamic is\nestablished, the existence of an optimal solution for our general form of\noptimal control is obtained, and the full form of the nonsmooth Pontryagin\nmaximum principle for strong local minimizers in (P) is derived under minimal\nhypotheses. One of the novelties of this paper is the idea to work with a\nwell-constructed problem corresponding to truncated sweeping sets and joint\nendpoint constraints that shares the same strong local minimizer as (P) and for\nwhich the exponential-penalty approximation technique can be developed using\nonly the assumptions on (P).","PeriodicalId":501286,"journal":{"name":"arXiv - MATH - Optimization and Control","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Optimization and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, the study of nonsmooth optimal control problems (P) involving a controlled sweeping process with three main characteristics is launched. First, the sweeping sets C(t) are nonsmooth, unbounded, time-dependent, uniformly prox-regular, and satisfy minimal assumptions. Second, the sweeping process is coupled with a controlled differential equation. Third, joint-state endpoints constraint set S, including periodic conditions, is present. The existence and uniqueness of a Lipschitz solution for our dynamic is established, the existence of an optimal solution for our general form of optimal control is obtained, and the full form of the nonsmooth Pontryagin maximum principle for strong local minimizers in (P) is derived under minimal hypotheses. One of the novelties of this paper is the idea to work with a well-constructed problem corresponding to truncated sweeping sets and joint endpoint constraints that shares the same strong local minimizer as (P) and for which the exponential-penalty approximation technique can be developed using only the assumptions on (P).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最小假设条件下耦合扫频过程的最优控制
首先,扫描集合 C(t) 是非光滑、无边界、随时间变化、均匀近似规则的,并且满足最小假设。第二,扫频过程与受控微分方程耦合。第三,存在联合状态端点约束集 S,包括周期条件。本文建立了我们的动态 Lipschitz 解的存在性和唯一性,得到了我们的最优控制一般形式的最优解的存在性,并在最小假设条件下推导出了(P)中强局部最小化的非光滑 Pontryagin 最大原理的完整形式。本文的新颖之处之一是提出了与截断扫频集和联合端点约束相对应的构造良好的问题,该问题与(P)具有相同的强局部最小值,只需使用对(P)的假设,就能开发出指数惩罚近似技术。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Trading with propagators and constraints: applications to optimal execution and battery storage Upgrading edges in the maximal covering location problem Minmax regret maximal covering location problems with edge demands Parametric Shape Optimization of Flagellated Micro-Swimmers Using Bayesian Techniques Rapid and finite-time boundary stabilization of a KdV system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1