Optimal Control of Population Dynamics

This paper studies the role of projection algorithms in conditional set membership estimation. These algorithms are known to be suboptimal in terms of the worst-case estimation error. A tight upper bound on the error of central projection estimators and interpolatory projection estimators is computed as a function of the conditional radius of information. Since the radius of information represents the minimum achievable error, the derived bound provides a measure of the reliability level of the suboptimal algorithms. The results are derived in a general deterministic setting, which allows the consideration of linearly parametrized approximations of a compact set of feasible problem elements.