Double Saddle-Point Preconditioning for Krylov Methods in the Inexact Sequential Homotopy Method
From MaRDI portal
Numerical methods based on nonlinear programming (49M37) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Control/observation systems governed by partial differential equations (93C20)
Abstract: We derive an extension of the sequential homotopy method that allows for the application of inexact Krylov methods for the linear (double) saddle-point systems arising in the local semismooth Newton method for the homotopy subproblems. For the class of problems that exhibit (after suitable partitioning of the variables) a zero in the off-diagonal blocks of the Hessian of the Lagrangian, we propose and analyze an efficient, parallelizable, symmetric positive definite preconditioner based on a double Schur complement approach. For discretized optimal control problems with PDE constraints, this structure is often present with the canonical partitioning of the variables in states and controls. We conclude with numerical results for a badly conditioned and highly nonlinear benchmark optimization problem with elliptic partial differential equations and control bounds. The resulting method is faster than using direct linear algebra for the 2D benchmark and allows for the parallel solution of large 3D problems.
This page was built for publication: Double Saddle-Point Preconditioning for Krylov Methods in the Inexact Sequential Homotopy Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6385223)
