A proof of Pontryagin's minimum principle using dynamic programming (Q1206934): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: The necessary conditions for optimal control in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pontryagin Maximum Principle From Dynamic Programming and Viscosity Solutions to First-Order Partial Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4743352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4086303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3755683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The contingent and the paratingent as generalized derivatives for vector-valued and set-valued mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calcul sous-différentiel et optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the relationship between dynamic programming and the maximum principle / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-247x(92)90033-a / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152367833 / rank
 
Normal rank

Latest revision as of 09:44, 30 July 2024

scientific article
Language Label Description Also known as
English
A proof of Pontryagin's minimum principle using dynamic programming
scientific article

    Statements

    A proof of Pontryagin's minimum principle using dynamic programming (English)
    0 references
    1 April 1993
    0 references
    The author proves the Pontryagin's Minimum Principle for a fixed-time optimal control problem without end-point constraints using a dynamic programming approach. The proof replaces the result which states that the value function is a continuous viscosity subsolution of the Hamilton- Jacobi-Bellman equation by two other results. It is pointed out that his proof is easier than others known in the literature.
    0 references
    0 references
    Pontryagin's Minimum Principle
    0 references
    fixed-time optimal control
    0 references
    continuous viscosity subsolution
    0 references
    Hamilton-Jacobi-Bellman equation
    0 references
    0 references
    0 references