Number of the records: 1

Solving Reachability Problems by a Scalable Constrained Optimization Method

SYSNO ASEP	0504815
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve WOS
Title	Solving 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 Title	Optimization and Engineering. - : Springer - ISSN 1389-4420 Roč. 21, č. 1 (2020), s. 215-239
Number of pages	25 s.
Language	eng - English
Country	NL - Netherlands
Keywords	Optimization ; Dynamical systems ; Boundary value problems ; Sequential quadratic programming ; Reachability
Subject RIV	IN - Informatics, Computer Science
OECD category	Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
R&D Projects	GA15-14484S GA ČR - Czech Science Foundation (CSF)
Method of publishing	Limited access
Institutional support	UIVT-O - RVO:67985807
UT WOS	000516560400009
EID SCOPUS	85067233316
DOI	10.1007/s11081-019-09441-6
Annotation	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.
Workplace	Institute of Computer Science
Contact	Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
Year of Publishing	2021
Electronic address	http://dx.doi.org/10.1007/s11081-019-09441-6

Number of the records: 1