Počet záznamů: 1  

Solving Reachability Problems by a Scalable Constrained Optimization Method

  1. 1.
    0504815 - ÚI 2021 RIV NL eng J - Článek v odborném periodiku
    Kuřátko, Jan - Ratschan, Stefan
    Solving Reachability Problems by a Scalable Constrained Optimization Method.
    Optimization and Engineering. Roč. 21, č. 1 (2020), s. 215-239. ISSN 1389-4420. E-ISSN 1573-2924
    Grant CEP: GA ČR GA15-14484S
    Institucionální podpora: RVO:67985807
    Klíčová slova: Optimization * Dynamical systems * Boundary value problems * Sequential quadratic programming * Reachability
    Kód oboru RIV: IN - Informatika
    Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impakt faktor: 2.760, rok: 2020

    In 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.
    Trvalý link: http://hdl.handle.net/11104/0296371
Počet záznamů: 1