A computational method for convex optimal control problems involving linear hereditary systems
We consider a class of convex optimal control problems involving a linear hereditary system. The main aim of the paper is to devise a computational algorithm for generating a minimizing sequence of controls such that the sequence converges to the optimal control in both the weak* topology of L∞ and...
Uloženo v:
| Vydáno v: | International journal of systems science Ročník 12; číslo 9; s. 1045 - 1060 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Taylor & Francis Group
01.01.1981
|
| ISSN: | 0020-7721, 1464-5319 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | We consider a class of convex optimal control problems involving a linear hereditary system. The main aim of the paper is to devise a computational algorithm for generating a minimizing sequence of controls such that the sequence converges to the optimal control in both the weak* topology of L∞ and the almost-everywhere topology. |
|---|---|
| ISSN: | 0020-7721 1464-5319 |
| DOI: | 10.1080/00207728108963803 |