Počet záznamů: 1  

Solving Reachability Problems by a Scalable Constrained Optimization Method

  1. 1.
    SYSNO ASEP0504815
    Druh ASEPJ - Článek v odborném periodiku
    Zařazení RIVJ - Článek v odborném periodiku
    Poddruh JOstatní články
    NázevSolving Reachability Problems by a Scalable Constrained Optimization Method
    Tvůrce(i) Kuřátko, Jan (UIVT-O) RID, SAI, ORCID
    Ratschan, Stefan (UIVT-O) SAI, RID, ORCID
    Zdroj.dok.Optimization and Engineering - ISSN 1389-4420
    First Online: 05 June (2019)
    Poč.str.25 s.
    Jazyk dok.eng - angličtina
    Země vyd.NL - Nizozemsko
    Klíč. slovaOptimization ; Dynamical systems ; Boundary value problems ; Sequential quadratic programming ; Reachability
    Vědní obor RIVIN - Informatika
    Obor OECDComputer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    CEPGA15-14484S GA ČR - Grantová agentura ČR
    Institucionální podporaUIVT-O - RVO:67985807
    DOI10.1007/s11081-019-09441-6
    AnotaceIn this paper we consider the problem of finding an evolution of a dynamical system that originates and terminates in given sets of states. However, if such an evolution exists then it is usually not unique. We investigate this problem and find a scalable approach for solving it. In addition, the resulting saddle-point matrix is sparse. We exploit the structure in order to reach an efficient implementation of our method. In computational experiments we compare line search and trust-region methods as well as various methods for Hessian approximation.
    PracovištěÚstav informatiky
    KontaktTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Rok sběru2020