Abstract
An efficient preconditioning technique used earlier for two-by-two block matrix systems with square matrix blocks is shown to be applicable also for a state variable box-constrained optimal control problem. The problem is penalized by a standard regularization term for the control variable and for the box-constraint, using a Moreau–Yosida penalization method. It is shown that there occur very few nonlinear iteration steps and also few iterations to solve the arising linearized equations on the fine mesh. This holds for a wide range of the penalization and discretization parameters. The arising nonlinearity can be handled with a hybrid nonlinear-linear procedure that raises the computational efficiency of the overall solution method.
Acknowledgements
Comments by the anonymous reviewers on the original version of this paper enabled improvements of the presentation and are highly appreciated.
We are indebted to Johanna Brodin who performed anew all numerous numerical tests with the software that enabled more detailed analysis and deeper understanding of the numerical behaviour of the coupled nonlinear-linear solver used in the experiments.
The work of the first author was supported by The Ministry of Education, Youth and Sports of the Czech Republic from the National Programme of Sustainability (NPU II) project IT4Innovations excellence in science – LQ1602.
References
[1] O. Axelsson, Iterative Solution Methods. Cambridge University Press, Cambridge, 1994.10.1017/CBO9780511624100Search in Google Scholar
[2] O. Axelsson, On mesh independence and Newton type methods. Proc. Int. Symposium on Numerical Analyses (ISNA92), Prague, 1992, Appl. Math. 38 (1993), 249–265.10.21136/AM.1993.104554Search in Google Scholar
[3] O. Axelsson, S. Farouq, and M. Neytcheva, Comparison of preconditioned Krylov subspace iteration methods for PDE- constrained optimization problems. Poisson and convection–diffusion control. Numer. Alg., 73 (2016) 631–663.10.1007/s11075-016-0111-1Search in Google Scholar
[4] O. Axelsson, S. Farouq, and M. Neytcheva, A preconditioner for optimal control problems, constrained by Stokes equation with a time-harmonic control. J. Comput. Appl. Math., 310 (2017), 5–18.10.1016/j.cam.2016.05.029Search in Google Scholar
[5] O. Axelsson and W. Layton, A two-level method for the discretization of nonlinear boundary value problems. SIAM J. Numer. Anal., 33 (1996), 2359–2374.10.1137/S0036142993247104Search in Google Scholar
[6] O. Axelsson and M. Neytcheva, Algebraic multilevel iteration method for Stieltjes matrices, Numer. Linear Alg. Appl., 1 (1994), 213–236.10.1002/nla.1680010302Search in Google Scholar
[7] O. Axelsson, M. Neytcheva, and B. Ahmad, A comparison of iterative methods to solve complex valued linear algebraic systems, Numer. Alg., 66 (2014), 811–841.10.1007/s11075-013-9764-1Search in Google Scholar
[8] O. Axelsson and P. S. Vassilevski, Algebraic multilevel preconditioning methods, I. Numer. Math., 56 (1989), 157–177.10.1007/BF01409783Search in Google Scholar
[9] W. Bangerth, R. Hartmann and G. Kanschat, deal.II – a general-purpose object-oriented finite element library, ACM Trans. Math. Software, 33 (2007), article 24. URL: http://www.dealii.org/10.1145/1268776.1268779Search in Google Scholar
[10] P. Boyanova and M. Neytcheva, Efficient numerical solution of discrete multi-component Cahn–Hilliard systems Comput. Math. Appl., 67 (2014), 106–121.10.1016/j.camwa.2013.10.013Search in Google Scholar
[11] R. D. Falgout, An introduction to algebraic multigrid. Comput. Sci. Engrg., 8 (2006), 24–33.10.1109/MCSE.2006.105Search in Google Scholar
[12] A. Greenbaum, Iterative Methods for Solving Linear Systems. Frontiers in Applied Mathematics, Vol. 17, SIAM, Philadelphia, PA, 1997.10.1137/1.9781611970937Search in Google Scholar
[13] R. Herzog and E. W. Sachs, Preconditioned conjugate gradient method for optimal control problems with control and state constraints. SIAM J. Matrix Anal. Appl., 31 (2010), 2291–2317.10.1137/090779127Search in Google Scholar
[14] M. Hintermüller and M. Hinze, Moreau–Yosida regularization in state constrained elliptic control problems: error estimates and parameter adjustment. SIAM J. Numer. Anal., 47 (2009), 1666-1683.10.1137/080718735Search in Google Scholar
[15] M. Hintemüller, K. Ito, and K. Kunisch, The primal-dual active set strategy as a semismooth Newton method, SIAM J. Optim., 13 (2002), 865–888.10.1137/S1052623401383558Search in Google Scholar
[16] K. Ito and K. Kunisch, Semi-smooth Newton methods for state-constrained optimal control problems. Systems & Control Letters, 5 (2003), 221–228.10.1016/S0167-6911(03)00156-7Search in Google Scholar
[17] Y. Notay, An aggregation-based algebraic multigrid method. ETNA, 37 (2010), 123–146.Search in Google Scholar
[18] J. W. Pearson, M. Stoll, and A. J. Wathen, Preconditioners for state-constrained optimal control problems with Moreau– Yosida penalty function. Numer. Linear Alg. Appl., 21 (2014), 81–97.10.1002/nla.1863Search in Google Scholar
[19] M. Porcelli, V. Simoncini, and M. Tani, Preconditioning of active-set Newton method for PDE-constrained optimal control problems, SIAM J. Sci. Comput., 37 (2015), 472–502.10.1137/140975711Search in Google Scholar
[20] Y. Saad, Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia, PA, 2003.10.1137/1.9780898718003Search in Google Scholar
[21] The Trilinos project. URL: https://trilinos.org/Search in Google Scholar
[22] P. S. Vassilevski, Multilevel Block Factorization Preconditioners. Springer-Verlag, New York, 2008.Search in Google Scholar
[23] J. Xu, A novel two-grid method for semilinear elliptic equations. SIAM J. Sci. Comp., 15 (1994), 231–237.10.1137/0915016Search in Google Scholar
[24] J. Xu, Two-grid discretization techniques for linear and nonlinear PDEs. SIAM J. Numer. Anal., 33 (1996), 1759–1777.10.1137/S0036142992232949Search in Google Scholar
[25] I. Yousept, Optimal control of Maxwell’s equations with regularized state constraints. Comput. Optim. Appl., 52 (2012), 559–581.10.1007/s10589-011-9422-2Search in Google Scholar
© 2018 Walter de Gruyter GmbH, Berlin/Boston
