A viability algorithm
Consider the differential inclusion \((*)\) \(x'(t)\in F(t,x(t))\), where \(F\) is a given multifunction with values in finite dimensional space. A set \(K\) is called a viability set for \((*)\) if for every \(x_ 0\in K\) there exists a solution of \((*)\) starting from \(x_ 0\) which remains in \(K\). If \(K\) is not a viability set one can look for a smaller (resp. largest) viability set contained in \(K\). In this paper, supposing that \(F\) is an upper semicontinuous compact convex valued multifunction and \(K\) is a compact set, the authors define an algorithm to provide a viability subset of \(K\).
- scientific article; zbMATH DE number 4122712
- Viability theorems and an application
- An anti-diffusive scheme for viability problems
- Viability theory
- Viability theory
- Algorithm survival analysis
- A viability approach to the skorohod problem
- A Survey of Viability Theory
- The problem of survival from an algorithmic point of view
- Approximation of the viability kernel
- Approximation of the viability kernel
- Viability criteria for differential inclusions
- A Viability Theorem for Morphological Inclusions
- scientific article; zbMATH DE number 4038614 (Why is no real title available?)
- scientific article; zbMATH DE number 891126 (Why is no real title available?)
- scientific article; zbMATH DE number 5244339 (Why is no real title available?)
- scientific article; zbMATH DE number 4186676 (Why is no real title available?)
- Viability of boundary of the viability kernel
- A kd-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves
This page was built for publication: A viability algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685787)
