A nonsmooth primal-dual method with interwoven PDE constraint solver
arXiv:2211.04807 · doi:10.1007/s10589-024-00587-3
Abstract
We introduce an efficient first-order primal-dual method for the solution of nonsmooth PDE-constrained optimization problems. We achieve this efficiency through not solving the PDE or its linearisation on each iteration of the optimization method. Instead, we run the method interwoven with a simple conventional linear system solver (Jacobi, Gauss-Seidel, conjugate gradients), always taking only one step of the linear system solver for each step of the optimization method. The control parameter is updated on each iteration as determined by the optimization method. We prove linear convergence under a second-order growth condition, and numerically demonstrate the performance on a variety of PDEs related to inverse problems involving boundary measurements.
References in corpus (10)
- A primal-dual hybrid gradient method for non-linear operators with applications to MRI
- Primal-dual extragradient methods for nonlinear nonsmooth PDE-constrained optimization
- Relaxed Gauss-Newton methods with applications to electrical impedance tomography
- Acceleration and global convergence of a first-order primal--dual method for nonconvex problems
- Testing and non-linear preconditioning of the proximal point method
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Linearly convergent bilevel optimization with single-step inner methods
- Electrodeless electrode model for electrical impedance tomography
- Primal-dual block-proximal splitting for a class of non-convex problems
- Regularisation, optimisation, subregularity