On regularization of the Lagrange principle in the optimization problems for linear distributed Volterra type systems with operator constraints

V. Sumin, M. I. Sumin
{"title":"On regularization of the Lagrange principle in the optimization problems for linear distributed Volterra type systems with operator constraints","authors":"V. Sumin, M. I. Sumin","doi":"10.35634/2226-3594-2022-59-07","DOIUrl":null,"url":null,"abstract":"Regularization of the classical optimality conditions - the Lagrange principle and the Pontryagin maximum principle - in a convex optimal control problem subject to functional equality and inequality constraints is considered. The controlled system is described by a linear functional-operator equation of second kind of the general form in the space $L_2^m$. The main operator on the right-hand side of the equation is assumed to be quasi-nilpotent. The objective functional to be minimized is strongly convex. The derivation of the regularized classical optimality conditions is based on the use of the dual regularization method. The main purpose of the regularized Lagrange principle and regularized Pontryagin maximum principle is to stably generate minimizing approximate solutions in the sense of J. Warga. As an application of the results obtained for the general linear functional-operator equation of second kind, two examples of concrete optimal control problems related to a system of delay equations and to an integro-differential transport equation are discussed.","PeriodicalId":42053,"journal":{"name":"Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta","volume":"10 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35634/2226-3594-2022-59-07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Regularization of the classical optimality conditions - the Lagrange principle and the Pontryagin maximum principle - in a convex optimal control problem subject to functional equality and inequality constraints is considered. The controlled system is described by a linear functional-operator equation of second kind of the general form in the space $L_2^m$. The main operator on the right-hand side of the equation is assumed to be quasi-nilpotent. The objective functional to be minimized is strongly convex. The derivation of the regularized classical optimality conditions is based on the use of the dual regularization method. The main purpose of the regularized Lagrange principle and regularized Pontryagin maximum principle is to stably generate minimizing approximate solutions in the sense of J. Warga. As an application of the results obtained for the general linear functional-operator equation of second kind, two examples of concrete optimal control problems related to a system of delay equations and to an integro-differential transport equation are discussed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带算子约束的线性分布Volterra型系统优化问题中拉格朗日原理的正则化
研究了一类具有函数等式和不等式约束的凸最优控制问题中经典最优性条件拉格朗日原理和庞特里亚金极大值原理的正则化问题。被控系统用空间$L_2^m$中一般形式的第二类线性泛函算子方程来描述。假设方程右边的主算子是拟幂零的。要最小化的目标泛函是强凸的。正则化经典最优性条件的推导基于对偶正则化方法的使用。正则化拉格朗日原理和正则化庞特里亚金极大值原理的主要目的是稳定地生成J. Warga意义上的最小化近似解。作为对第二类一般线性泛函算子方程所得结果的应用,讨论了与时滞方程组和积分-微分输运方程有关的两个具体最优控制问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.00
自引率
0.00%
发文量
0
期刊最新文献
Integration of the mKdV Equation with nonstationary coefficients and additional terms in the case of moving eigenvalues On the exploitation of a population given by a system of linear equations with random parameters Asymptotic expansion of the solution to an optimal control problem for a linear autonomous system with a terminal convex quality index depending on slow and fast variables Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices A bottleneck routing problem with a system of priority tasks
×
引用
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