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%2F00216208%3A11320%2F20%3A10426475" target="_blank" >RIV/00216208:11320/20:10426475 - isvavai.cz</a>
Alternative codes found
RIV/67985807:_____/20:00504815
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=6p1QR-R9St" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=6p1QR-R9St</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
10102 - Applied mathematics

Project
—
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)