Convergent computational method for relaxed optimal control problems (Q916074): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A computational method for a class of optimal relaxed control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control parametrization: a unified approach to optimal control problems with general constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed Controls and the Convergence of Optimal Control Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained optimization: A general tolerance approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential gradient-restoration algorithm for optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinearly constrained discrete-time optimal-control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4743352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975260 / rank
 
Normal rank

Latest revision as of 08:46, 21 June 2024

scientific article
Language Label Description Also known as
English
Convergent computational method for relaxed optimal control problems
scientific article

    Statements

    Convergent computational method for relaxed optimal control problems (English)
    0 references
    1991
    0 references
    A class of relaxed optimal control problems for ordinary differential equations with a state-space constraint is considered. The discretization by the control parametrization method, formerly proposed by \textit{K. L. Teo} and \textit{C. J. Goh} [ibid. 60, No.1, 117-133 (1989; Zbl 0632.49017); Automatica 24, 3-18 (1988; Zbl 0637.49017)], is modified by admitting a tolerance in the state constraint, which enables one to prove a conditional convergence under certain additional qualification on the dynamics. Also, a counterexample is constructed, showing that the original, nonmodified discretization need not approximate the continuous problem.
    0 references
    relaxed optimal control
    0 references
    control parametrization method
    0 references
    state constraint
    0 references
    convergence
    0 references
    discretization
    0 references
    0 references

    Identifiers