On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems (Q1321655): Difference between revisions

We consider a pair consisting of an optimization problem and its optimality function \((P,\theta)\), and define consistency of approximating problem-optimality function pairs, \((P_ N,\theta_ N)\) to \((P,\theta)\), in terms of the epigraphical convergence of the \(P_ N\) to \(P\), and the hypographical convergence of the optimality functions \(\theta_ N\) to \(\theta\). We then show that standard discretization techniques decompose semi-infinite optimization and optimal control problems into families of finite-dimensional problems, which, together with associated optimality functions, are consistent discretizations to the original problems. We then present two types of techniques for using consistent approximations in obtaining an approximate solution of the original problems. The first is a ``filter'' type technique, similar to that used in conjunction with penalty functions, the second one is an adaptive discretization technique that can be viewed as an implementation of a conceptual algorithm for solving the original problems.