pith. sign in

arxiv: 1603.07099 · v1 · pith:LUDDJJGJnew · submitted 2016-03-23 · 🧮 math.NA · math.OC

How not to discretize the control

classification 🧮 math.NA math.OC
keywords controldiscretediscretizationfeasiblehigherlimitsorderpolynomials
0
0 comments X
read the original abstract

In this short note, we address the discretization of optimal control problems with higher order polynomials. We develop a necessary and sufficient condition to ensure that weak limits of discrete feasible controls are feasible for the original problem. We show by means of a simple counterexample that a naive discretization by higher order polynomials can lead to non-feasible limits of sequences of discrete solutions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.