Number of the records: 1  

Solving Reachability Problems by a Scalable Constrained Optimization Method

  1. 1.
    SYSNO ASEP0504815
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleSolving Reachability Problems by a Scalable Constrained Optimization Method
    Author(s) Kuřátko, Jan (UIVT-O) RID, SAI, ORCID
    Ratschan, Stefan (UIVT-O) SAI, RID, ORCID
    Source TitleOptimization and Engineering - ISSN 1389-4420
    Roč. 21, č. 1 (2020), s. 215-239
    Number of pages25 s.
    Languageeng - English
    CountryNL - Netherlands
    KeywordsOptimization ; Dynamical systems ; Boundary value problems ; Sequential quadratic programming ; Reachability
    Subject RIVIN - Informatics, Computer Science
    OECD categoryComputer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    R&D ProjectsGA15-14484S GA ČR - Czech Science Foundation (CSF)
    Method of publishingLimited access
    Institutional supportUIVT-O - RVO:67985807
    UT WOS000516560400009
    EID SCOPUS85067233316
    DOI10.1007/s11081-019-09441-6
    AnnotationIn 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.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2021
    Electronic addresshttp://dx.doi.org/10.1007/s11081-019-09441-6
Number of the records: 1