Solving Reachability Problems by a Scalable Constrained Optimization Method

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F20%3A00504815" target="_blank" >RIV/67985807:_____/20:00504815 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/20:10426475
Result on the web
<a href="http://dx.doi.org/10.1007/s11081-019-09441-6" target="_blank" >http://dx.doi.org/10.1007/s11081-019-09441-6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11081-019-09441-6" target="_blank" >10.1007/s11081-019-09441-6</a>

Result language
angličtina
Original language name
Solving Reachability Problems by a Scalable Constrained Optimization Method
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA15-14484S" target="_blank" >GA15-14484S: Simulation-Based Computation of Robust Invariants of Hybrid Dynamical Systems</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)