On Block Triangular Preconditioners for the Interior Point Solution of PDE-Constrained Optimization Problems
We consider the numerical solution of saddle point systems of equations resulting from the discretization of PDE-constrained optimization problems, with additional bound constraints on the state and control variables, using an interior point method. In particular, we derive a Bramble–Pasciak Conjugate Gradient method and a tailored block triangular preconditioner which may be applied within it. Crucial to the usage of the preconditioner are carefully chosen approximations of the (1, 1)-block and Schur complement of the saddle point system. To apply the inverse of the Schur complement approximation, which is computationally the most expensive part of the preconditioner, one may then utilize methods such as multigrid or domain decomposition to handle individual sub-blocks of the matrix system.
JWP gratefully acknowledges financial support from the Engineering and Physical Sciences Research Council (EPSRC) Fellowship EP/M018857/2. JG gratefully acknowledges support from the EPSRC Grant EP/N019652/1. The authors thank an anonymous referee for their helpful comments.
- 5.A. Drǎgǎnescu, C. Petra, Multigrid preconditioning of linear systems for interior point methods applied to a class of box-constrained optimal control problems. SIAM J. Numer. Anal. 50(1), 328–353 (2012)Google Scholar
- 12.Y. Notay, AGMG Software and Documentation, see http://homepages.ulb.ac.be/~ynotay/AGMG
- 18.M. Stoll, Solving linear systems using the adjoint, DPhil thesis, University of Oxford, 2008Google Scholar