Related papers: Local Inverse Geometry Can Be Amortized
Incorporating prior information into inverse problems, e.g. via maximum-a-posteriori estimation, is an important technique for facilitating robust inverse problem solutions. In this paper, we devise two novel approaches for linear inverse…
The heart of the a priori and a posteriori error control in convex minimization problems is the sharp control of the differences of discrete and exact minimal energy. Conforming finite element discretizations for p-Laplace type minimization…
This paper studies a class of double-loop (inner-outer) algorithms for convex composite optimization. For unconstrained problems, we develop a restarted accelerated composite gradient method that attains the optimal first-order complexity…
Nonlinear inverse problems have complicated landscapes. Hence the calculation with naive iterative schemes (e.g., Gauss-Newton or conjugate gradients) is trapped in local minima. The (first) Born approximation can avoid this trapping but…
We develop a method for optimization in shape spaces, i.e., sets of surfaces modulo re-parametrization. Unlike previously proposed gradient flows, we achieve superlinear convergence rates through a subtle approximation of the shape Hessian,…
We extend the applicability of the popular interior-penalty discontinuous Galerkin (dG) method discretizing advection-diffusion-reaction problems to meshes comprising extremely general, essentially arbitrarily-shaped element shapes. In…
Image registration is a fundamental step in medical image analysis. Ideally, the transformation that registers one image to another should be a diffeomorphism that is both invertible and smooth. Traditional methods like geodesic shooting…
We provide a unified analysis of a posteriori and a priori error bounds for a broad class of discontinuous Galerkin and $C^0$-IP finite element approximations of fully nonlinear second-order elliptic Hamilton--Jacobi--Bellman and Isaacs…
We propose a novel numerical inversion algorithm for the coefficients of parabolic partial differential equations, based on model reduction. The study is motivated by the application of controlled source electromagnetic exploration, where…
The number and relative placement of BPMs and steerers with respect to the quadrupoles in a circular lattice can lead to degeneracy in the context of inverse modeling of accelerator optics. Further, the measurement uncertainties introduced…
This paper analyses discontinuous Galerkin finite element methods (DGFEM) to approximate a regular solution to the von K\'arm\'an equations defined on a polygonal domain. A discrete inf-sup condition sufficient for the stability of the…
We present a new residual-type energy-norm a posteriori error analysis for interior penalty discontinuous Galerkin (dG) methods for linear elliptic problems. The new error bounds are also applicable to dG methods on meshes consisting of…
We propose a conceptually new method for solving nonlinear inverse scattering problems (ISPs) such as are commonly encountered in tomographic ultrasound imaging, seismology and other applications. The method is inspired by the theory of…
The existing inverse power ($\mathbf{IP}$) method for solving the balanced graph cut lacks local convergence and its inner subproblem requires a nonsmooth convex solver. To address these issues, we develop a simple inverse power…
Due to their uncertainty quantification, Bayesian solutions to inverse problems are the framework of choice in applications that are risk averse. These benefits come at the cost of computations that are in general, intractable. New advances…
Nonlinear systems of partial differential equations (PDEs) may permit several distinct solutions. The typical current approach to finding distinct solutions is to start Newton's method with many different initial guesses, hoping to find…
In this paper we the formulation of inverse problems as constrained minimization problems and their iterative solution by gradient or Newton type. We carry out a convergence analysis in the sense of regularization methods and discuss…
We present the two-dimensional unstructured grids extension of the a posteriori local subcell correction of discontinuous Galerkin (DG) schemes introduced in [52]. The technique is based on the reformulation of DG scheme as a finite volume…
A novel computational, non-iterative and noise-robust reconstruction method is introduced for the planar anisotropic inverse conductivity problem. The method is based on bypassing the unstable step of the reconstruction of the values of the…
Optical diffraction tomography relies on solving an inverse scattering problem governed by the wave equation. Classical reconstruction algorithms are based on linear approximations of the forward model (Born or Rytov), which limits their…