The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control (Q4179449): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0316037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978873681 / rank
 
Normal rank

Latest revision as of 21:49, 19 March 2024

scientific article; zbMATH DE number 3615416
Language Label Description Also known as
English
The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control
scientific article; zbMATH DE number 3615416

    Statements

    The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control (English)
    0 references
    0 references
    0 references
    1978
    0 references
    Partial Differential Inequality
    0 references
    Convex Mathematical Programming Problems
    0 references
    Relaxed Control Problem
    0 references
    Space of Radon Measures
    0 references
    Weak Problem
    0 references
    Conditions for Optimality of Dynamic Programming Type
    0 references
    Convex Analysis
    0 references
    Bellman Equation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references