Relationship Between the Maximum Principle and Dynamic Programming for Minimax Problems
This paper is concerned with the relationship between the maximum principle and dynamic programming for a large class of optimal control problems with maximum running cost. Inspired by a technique introduced by Vinter in the 1980s, we are able to obtain jointly a global and a partial sensitivity rel...
Gespeichert in:
Veröffentlicht in: | Applied mathematics & optimization 2023-04, Vol.87 (2), p.34, Article 34 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 2 |
container_start_page | 34 |
container_title | Applied mathematics & optimization |
container_volume | 87 |
creator | Hermosilla, Cristopher Zidani, Hasnaa |
description | This paper is concerned with the relationship between the maximum principle and dynamic programming for a large class of optimal control problems with maximum running cost. Inspired by a technique introduced by Vinter in the 1980s, we are able to obtain jointly a global and a partial sensitivity relation that link the coextremal with the value function of the problem at hand. One of the main contributions of this work is that these relations are derived by using a single perturbed problem, and therefore, both sensitivity relations hold, at the same time, for the same coextremal. As a by-product, and thanks to the level-set approach, we obtain a new set of sensitivity relations for Mayer problems with state constraints. One important feature of this last result is that it holds under mild assumptions, without the need of imposing strong compatibility assumptions between the dynamics and the state constraints set. |
doi_str_mv | 10.1007/s00245-022-09943-3 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2775845871</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2775845871</sourcerecordid><originalsourceid>FETCH-LOGICAL-c314t-29cf7768205cd79806faed74c63fe6672d016c722ecb2f4143ee9533fa98e1e53</originalsourceid><addsrcrecordid>eNp9kMtOwzAQRS0EEqXwA6wssQ74kdjJEspTagVCIJaW64xbV4lT7FS0f49LkNixGs3o3jszB6FzSi4pIfIqEsLyIiOMZaSqcp7xAzSiOU-tIOIQjQipiiwXVByjkxhXJOm54CP08QqN7l3n49Kt8Q30XwAe90vAM7117abFL8F549YNYO1rfLvzunUmTbtF0G3r_ALbLuCZ867V2_183kAbT9GR1U2Es986Ru_3d2-Tx2z6_PA0uZ5mhtO8z1hlrJSiZKQwtaxKIqyGWuZGcAtCSFYTKoxkDMyc2Tx9BFAVnFtdlUCh4GN0MeSuQ_e5gdirVbcJPq1UTMqizItS0qRig8qELsYAVq1DOjfsFCVqD1ANAFUCqH4AKp5MfDDFJPYLCH_R_7i-Aavoc20</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2775845871</pqid></control><display><type>article</type><title>Relationship Between the Maximum Principle and Dynamic Programming for Minimax Problems</title><source>SpringerLink Journals</source><source>EBSCOhost Business Source Complete</source><creator>Hermosilla, Cristopher ; Zidani, Hasnaa</creator><creatorcontrib>Hermosilla, Cristopher ; Zidani, Hasnaa</creatorcontrib><description>This paper is concerned with the relationship between the maximum principle and dynamic programming for a large class of optimal control problems with maximum running cost. Inspired by a technique introduced by Vinter in the 1980s, we are able to obtain jointly a global and a partial sensitivity relation that link the coextremal with the value function of the problem at hand. One of the main contributions of this work is that these relations are derived by using a single perturbed problem, and therefore, both sensitivity relations hold, at the same time, for the same coextremal. As a by-product, and thanks to the level-set approach, we obtain a new set of sensitivity relations for Mayer problems with state constraints. One important feature of this last result is that it holds under mild assumptions, without the need of imposing strong compatibility assumptions between the dynamics and the state constraints set.</description><identifier>ISSN: 0095-4616</identifier><identifier>EISSN: 1432-0606</identifier><identifier>DOI: 10.1007/s00245-022-09943-3</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Applied mathematics ; Calculus of Variations and Optimal Control; Optimization ; Control ; Dynamic programming ; Mathematical and Computational Physics ; Mathematical Methods in Physics ; Mathematics ; Mathematics and Statistics ; Maximum principle ; Minimax technique ; Numerical and Computational Physics ; Optimal control ; Optimization ; Ordinary differential equations ; Sensitivity ; Simulation ; Systems Theory ; Theoretical</subject><ispartof>Applied mathematics & optimization, 2023-04, Vol.87 (2), p.34, Article 34</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c314t-29cf7768205cd79806faed74c63fe6672d016c722ecb2f4143ee9533fa98e1e53</cites><orcidid>0000-0003-2975-5944</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00245-022-09943-3$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00245-022-09943-3$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Hermosilla, Cristopher</creatorcontrib><creatorcontrib>Zidani, Hasnaa</creatorcontrib><title>Relationship Between the Maximum Principle and Dynamic Programming for Minimax Problems</title><title>Applied mathematics & optimization</title><addtitle>Appl Math Optim</addtitle><description>This paper is concerned with the relationship between the maximum principle and dynamic programming for a large class of optimal control problems with maximum running cost. Inspired by a technique introduced by Vinter in the 1980s, we are able to obtain jointly a global and a partial sensitivity relation that link the coextremal with the value function of the problem at hand. One of the main contributions of this work is that these relations are derived by using a single perturbed problem, and therefore, both sensitivity relations hold, at the same time, for the same coextremal. As a by-product, and thanks to the level-set approach, we obtain a new set of sensitivity relations for Mayer problems with state constraints. One important feature of this last result is that it holds under mild assumptions, without the need of imposing strong compatibility assumptions between the dynamics and the state constraints set.</description><subject>Applied mathematics</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Control</subject><subject>Dynamic programming</subject><subject>Mathematical and Computational Physics</subject><subject>Mathematical Methods in Physics</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Maximum principle</subject><subject>Minimax technique</subject><subject>Numerical and Computational Physics</subject><subject>Optimal control</subject><subject>Optimization</subject><subject>Ordinary differential equations</subject><subject>Sensitivity</subject><subject>Simulation</subject><subject>Systems Theory</subject><subject>Theoretical</subject><issn>0095-4616</issn><issn>1432-0606</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp9kMtOwzAQRS0EEqXwA6wssQ74kdjJEspTagVCIJaW64xbV4lT7FS0f49LkNixGs3o3jszB6FzSi4pIfIqEsLyIiOMZaSqcp7xAzSiOU-tIOIQjQipiiwXVByjkxhXJOm54CP08QqN7l3n49Kt8Q30XwAe90vAM7117abFL8F549YNYO1rfLvzunUmTbtF0G3r_ALbLuCZ867V2_183kAbT9GR1U2Es986Ru_3d2-Tx2z6_PA0uZ5mhtO8z1hlrJSiZKQwtaxKIqyGWuZGcAtCSFYTKoxkDMyc2Tx9BFAVnFtdlUCh4GN0MeSuQ_e5gdirVbcJPq1UTMqizItS0qRig8qELsYAVq1DOjfsFCVqD1ANAFUCqH4AKp5MfDDFJPYLCH_R_7i-Aavoc20</recordid><startdate>20230401</startdate><enddate>20230401</enddate><creator>Hermosilla, Cristopher</creator><creator>Zidani, Hasnaa</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AO</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M2O</scope><scope>M2P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0003-2975-5944</orcidid></search><sort><creationdate>20230401</creationdate><title>Relationship Between the Maximum Principle and Dynamic Programming for Minimax Problems</title><author>Hermosilla, Cristopher ; Zidani, Hasnaa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c314t-29cf7768205cd79806faed74c63fe6672d016c722ecb2f4143ee9533fa98e1e53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Applied mathematics</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Control</topic><topic>Dynamic programming</topic><topic>Mathematical and Computational Physics</topic><topic>Mathematical Methods in Physics</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Maximum principle</topic><topic>Minimax technique</topic><topic>Numerical and Computational Physics</topic><topic>Optimal control</topic><topic>Optimization</topic><topic>Ordinary differential equations</topic><topic>Sensitivity</topic><topic>Simulation</topic><topic>Systems Theory</topic><topic>Theoretical</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hermosilla, Cristopher</creatorcontrib><creatorcontrib>Zidani, Hasnaa</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Applied mathematics & optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hermosilla, Cristopher</au><au>Zidani, Hasnaa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Relationship Between the Maximum Principle and Dynamic Programming for Minimax Problems</atitle><jtitle>Applied mathematics & optimization</jtitle><stitle>Appl Math Optim</stitle><date>2023-04-01</date><risdate>2023</risdate><volume>87</volume><issue>2</issue><spage>34</spage><pages>34-</pages><artnum>34</artnum><issn>0095-4616</issn><eissn>1432-0606</eissn><abstract>This paper is concerned with the relationship between the maximum principle and dynamic programming for a large class of optimal control problems with maximum running cost. Inspired by a technique introduced by Vinter in the 1980s, we are able to obtain jointly a global and a partial sensitivity relation that link the coextremal with the value function of the problem at hand. One of the main contributions of this work is that these relations are derived by using a single perturbed problem, and therefore, both sensitivity relations hold, at the same time, for the same coextremal. As a by-product, and thanks to the level-set approach, we obtain a new set of sensitivity relations for Mayer problems with state constraints. One important feature of this last result is that it holds under mild assumptions, without the need of imposing strong compatibility assumptions between the dynamics and the state constraints set.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s00245-022-09943-3</doi><orcidid>https://orcid.org/0000-0003-2975-5944</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0095-4616 |
ispartof | Applied mathematics & optimization, 2023-04, Vol.87 (2), p.34, Article 34 |
issn | 0095-4616 1432-0606 |
language | eng |
recordid | cdi_proquest_journals_2775845871 |
source | SpringerLink Journals; EBSCOhost Business Source Complete |
subjects | Applied mathematics Calculus of Variations and Optimal Control Optimization Control Dynamic programming Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Maximum principle Minimax technique Numerical and Computational Physics Optimal control Optimization Ordinary differential equations Sensitivity Simulation Systems Theory Theoretical |
title | Relationship Between the Maximum Principle and Dynamic Programming for Minimax Problems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T06%3A51%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Relationship%20Between%20the%20Maximum%20Principle%20and%20Dynamic%20Programming%20for%20Minimax%20Problems&rft.jtitle=Applied%20mathematics%20&%20optimization&rft.au=Hermosilla,%20Cristopher&rft.date=2023-04-01&rft.volume=87&rft.issue=2&rft.spage=34&rft.pages=34-&rft.artnum=34&rft.issn=0095-4616&rft.eissn=1432-0606&rft_id=info:doi/10.1007/s00245-022-09943-3&rft_dat=%3Cproquest_cross%3E2775845871%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2775845871&rft_id=info:pmid/&rfr_iscdi=true |