0504815 - ÚI 2021 RIV NL eng J - Journal Article
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
R&D Projects: GA ČR GA15-14484S
Institutional support: RVO:67985807
Keywords : Optimization * Dynamical systems * Boundary value problems * Sequential quadratic programming * Reachability
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 2.760, year: 2020 ; AIS: 0.801, rok: 2020
Method of publishing: Limited access
Result website:
http://dx.doi.org/10.1007/s11081-019-09441-6DOI: https://doi.org/10.1007/s11081-019-09441-6

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.
Permanent Link: http://hdl.handle.net/11104/0296371