Abstract

An optimal control problem governed by a bilinear elliptic equation is considered. This problem is solved by the sequential quadratic programming (SQP) method in an infinite-dimensional framework. In each level of this iterative method the solution of linear-quadratic subproblem is computed by a Galerkin projection using proper orthogonal decomposition (POD). Thus, an approximate (inexact) solution of the subproblem is determined. Based on a POD a-posteriori error estimator developed by Troltzsch and Volkwein [Comput. Opt. Appl. 44 (2009) 83–115] the difference of the suboptimal to the (unknown) optimal solution of the linear-quadratic subproblem is estimated. Hence, the inexactness of the discrete solution is controlled in such a way that locally superlinear or even quadratic rate of convergence of the SQP is ensured. Numerical examples illustrate the efficiency for the proposed approach.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call