Optimization of dynamic systems with rigorous path constraint satisfaction

Rigorous satisfaction of path constraints in dynamic optimization is important since they often reflect the safety and quality limits of a process. A difficulty that arises is that they have to be fulfilled during the whole time horizon. Most existing methods discretize these infinite constraints and cannot guarantee the satisfaction at all times. Fu et al. (2015) proposed an algorithm that finitely returns an approximate KKT-optimal point that …