Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 46 (1985), S. 295-317 
    ISSN: 1573-2878
    Keywords: Nonlinear time-lag systems ; linear control constraints ; nonlinear terminal inequality constraints ; conditional gradient methods ; feasible direction methods ; control parametrization ; initial feasible control ; computational schemes ; finite convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A computational algorithm for a class of time-lag optimal control problems involving control and terminal inequality constraints is presented. The convergence properties of the algorithm is also investigated. To test the algorithm, an example is solved.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 53 (1987), S. 461-474 
    ISSN: 1573-2878
    Keywords: Nonlinear time-lag systems ; linear control constraints ; nonlinear terminal inequality constraints ; feasible direction methods ; accumulation points ; relaxed controls ; relaxed control problems ; necessary conditions for optimality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we consider a class of time-lag optimal control problems involving control and terminal inequality constraints. A feasible direction algorithm has been obtained by Teo, Wong, and Clements for solving this class of optimal control problems. It was shown that anyL ∞ accumulation points of the sequence of controls generated by the algorithm satisfy a necessary condition for optimality. However, suchL ∞ accumulation points need not exist. The aim of this paper is to prove a convergence result, which ensures that the sequence of controls generated by the algorithm always has accumulation points in the sense of control measure, and these accumulation points satisfy a necessary condition for optimality for the corresponding relaxed problem.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...