A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems

Abstract

We present a systematic approach to the optimal placement of finitely many sensors in order to infer a finite-dimensional parameter from point evaluations of the solution of an associated parameter-dependent elliptic PDE. The quality of the corresponding least squares estimator is quantified by properties of the asymptotic covariance matrix depending on the distribution of the measurement sensors. We formulate a design problem where we minimize functionals related to the size of the corresponding confidence regions with respect to the position and number of pointwise measurements. The measurement setup is modeled by a positive Borel measure on the spatial experimental domain resulting in a convex optimization problem. For the algorithmic solution a class of accelerated conditional gradient methods in measure space is derived, which exploits the structural properties of the design problem to ensure convergence towards sparse solutions. Convergence properties are presented and the presented results are illustrated by numerical experiments.

arXiv comment35 pages, 15 figures

References in corpus (2)

• D-optimal designs via a cocktail algorithm
• Generalized conditional gradient: analysis of convergence and applications

Cited by in corpus (6)

• A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization
• Identification of Model Uncertainty via Optimal Design of Experiments Applied to a Mechanical Press
• Adaptive Gaussian Process Regression for Efficient Building of Surrogate Models in Inverse Problems
• Towards optimal sensor placement for inverse problems in spaces of measures
• First-Order Methods for Optimal Experimental Design Problems with Bound Constraints
• Sparse Source Identification in Transient Advection-Diffusion Problems with a Primal-Dual-Active-Point Strategy