Mathematics – Optimization and Control
Scientific paper
2010-12-06
Mathematics
Optimization and Control
Scientific paper
This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given instant, it will remain in the set forever in the future. Polytopic invariants for polynomial systems can be verified by solving a set of optimization problems involving multivariate polynomials on bounded polytopes. Using the blossoming principle together with properties of multi-affine functions on rectangles and Lagrangian duality, we show that certified lower bounds of the optimal values of such optimization problems can be computed effectively using linear programs. This allows us to propose a method based on linear programming for verifying polytopic invariant sets of polynomial dynamical systems. Additionally, using sensitivity analysis of linear programs, one can iteratively compute a polytopic invariant set. Finally, we show using a set of examples borrowed from biological applications, that our approach is effective in practice.
Ben Sassi Mohamed Amin
Girard Antoine
No associations
LandOfFree
Computation of Polytopic Invariants for Polynomial Dynamical Systems using Linear Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computation of Polytopic Invariants for Polynomial Dynamical Systems using Linear Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation of Polytopic Invariants for Polynomial Dynamical Systems using Linear Programming will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-168403