Trudy Instituta Matematiki i Mekhaniki UrO RAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2014, Volume 20, Number 3, Pages 204–217 (Mi timm1095)  

This article is cited in 5 scientific papers (total in 5 papers)

On the unimprovability of full-memory strategies in problems of guaranteed result optimization

D. A. Serkovab

a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
b Yeltsin Ural Federal University
Full-text PDF (238 kB) Citations (5)
References:
Abstract: A problem of guaranteed result optimization is considered for a control system described by an ordinary differential equation and for a performance functional that depends continuously on the trajectory of the system. The values of the control and of the disturbance satisfy compact geometric constraints. It is also assumed that the realization of the disturbance is subject to an unknown functional constraint from a given set of constraints that are compact in a Lebesgue space.
It is shown that the optimal guaranteed result in the class of full-memory strategies in this problem coincides with the value of the optimal guaranteed result in the class of quasi-strategies.
Keywords: optimal guaranteed result, full-memory control strategies, functionally constrained disturbances, quasi-strategies.
English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2015, Volume 291, Issue 1, Pages 157–172
DOI: https://doi.org/10.1134/S0081543815090114
Bibliographic databases:
Document Type: Article
UDC: 517.977
Language: Russian
Citation: D. A. Serkov, “On the unimprovability of full-memory strategies in problems of guaranteed result optimization”, Trudy Inst. Mat. i Mekh. UrO RAN, 20, no. 3, 2014, 204–217; Proc. Steklov Inst. Math. (Suppl.), 291, suppl. 1 (2015), 157–172
Citation in format AMSBIB
\Bibitem{Ser14}
\by D.~A.~Serkov
\paper On the unimprovability of full-memory strategies in problems of guaranteed result optimization
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2014
\vol 20
\issue 3
\pages 204--217
\mathnet{http://mi.mathnet.ru/timm1095}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3379225}
\elib{https://elibrary.ru/item.asp?id=23503122}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2015
\vol 291
\issue , suppl. 1
\pages 157--172
\crossref{https://doi.org/10.1134/S0081543815090114}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000366347200011}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84949528030}
Linking options:
  • https://www.mathnet.ru/eng/timm1095
  • https://www.mathnet.ru/eng/timm/v20/i3/p204
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:323
    Full-text PDF :77
    References:84
    First page:14
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024