{"title":"Pontryagin’s Maximum Principle for a State-Constrained System of Douglis-Nirenberg Type","authors":"Alexey S. Matveev, Dmitrii V. Sugak","doi":"10.1007/s10957-024-02499-y","DOIUrl":null,"url":null,"abstract":"<p>This article is concerned with optimal control problems for plants described by systems of high order nonlinear PDE’s (whose linear approximation is elliptic in the sense of Douglis-Nirenberg), with a special attention being given to their particular case: the standard stationary system of non-linear Navier–Stokes equations. The objective is to establish an analog of the Pontryagin’s maximum principle. The major challenge stems from the presence of infinitely many point-wise constraints on the system’s state, which are imposed at any point from a given continuum set of independent variables. Necessary conditions for optimality in the form of an “abstract” maximum principle are first obtained for a general optimal control problem couched in the language of functional analysis. This result is targeted at a wide class of problems, with an idea to absorb, in its proof, a great deal of technical work needed for derivation of optimality conditions so that only an interpretation of the discussed result would be basically needed to handle a particular problem. The applicability of this approach is demonstrated via obtaining the afore-mentioned analog of the Pontryagin’s maximum principle for a state-constrained system of high-order elliptic equations and the Navier–Stokes equations.\n</p>","PeriodicalId":50100,"journal":{"name":"Journal of Optimization Theory and Applications","volume":"4 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optimization Theory and Applications","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10957-024-02499-y","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
This article is concerned with optimal control problems for plants described by systems of high order nonlinear PDE’s (whose linear approximation is elliptic in the sense of Douglis-Nirenberg), with a special attention being given to their particular case: the standard stationary system of non-linear Navier–Stokes equations. The objective is to establish an analog of the Pontryagin’s maximum principle. The major challenge stems from the presence of infinitely many point-wise constraints on the system’s state, which are imposed at any point from a given continuum set of independent variables. Necessary conditions for optimality in the form of an “abstract” maximum principle are first obtained for a general optimal control problem couched in the language of functional analysis. This result is targeted at a wide class of problems, with an idea to absorb, in its proof, a great deal of technical work needed for derivation of optimality conditions so that only an interpretation of the discussed result would be basically needed to handle a particular problem. The applicability of this approach is demonstrated via obtaining the afore-mentioned analog of the Pontryagin’s maximum principle for a state-constrained system of high-order elliptic equations and the Navier–Stokes equations.
期刊介绍:
The Journal of Optimization Theory and Applications is devoted to the publication of carefully selected regular papers, invited papers, survey papers, technical notes, book notices, and forums that cover mathematical optimization techniques and their applications to science and engineering. Typical theoretical areas include linear, nonlinear, mathematical, and dynamic programming. Among the areas of application covered are mathematical economics, mathematical physics and biology, and aerospace, chemical, civil, electrical, and mechanical engineering.