相关论文: On the non-convexity issue in the radial Calder\'o…
We introduce a method for solving Calder\'on type inverse problems for semilinear equations with power type nonlinearities. The method is based on higher order linearizations, and it allows one to solve inverse problems for certain…
We generalize many recent uniqueness results on the fractional Calder\'on problem to cover the cases of all domains with nonempty exterior. The highlight of our work is the characterization of uniqueness and nonuniqueness of partial data…
The implementation of computational sensing strategies often faces calibration problems typically solved by means of multiple, accurately chosen training signals, an approach that can be resource-consuming and cumbersome. Conversely, blind…
Electrical Impedance Tomography gives rise to the severely ill-posed Calder\'on problem of determining the electrical conductivity distribution in a bounded domain from knowledge of the associated Dirichlet-to-Neumann map for the governing…
We consider the Calder\'on problem with partial data in certain admissible geometries, that is, on compact Riemannian manifolds with boundary which are conformally embedded in a product of the Euclidean line and a simple manifold. We show…
We derive exact reconstruction methods for cracks consisting of unions of Lipschitz hypersurfaces in the context of Calder\'on's inverse conductivity problem. Our first method obtains upper bounds for the unknown cracks, bounds that can be…
We investigate a generalization of Calder\'on's problem of recovering the conductivity coefficient in a conductivity equation from boundary measurements. As a model equation we consider the p-conductivity equation with p strictly between…
We consider the two-dimensional version of Calder\`on's problem. When the D-N map is assumed to be known up to an error level $\varepsilon_0$, we investigate how the resolution in the determination of the unknown conductivity deteriorates…
This paper concerns the problem of recovering an unknown but structured signal $x \in R^n$ from $m$ quadratic measurements of the form $y_r=|<a_r,x>|^2$ for $r=1,2,...,m$. We focus on the under-determined setting where the number of…
Lossless Convexification (LCvx) is a convexification technique that transforms a class of nonconvex optimal control problems$\unicode{x2013}$where the nonconvexity arises from a lower bound on the control norm$\unicode{x2013}$into…
We show global uniqueness in an inverse problem for the fractional Schr\"odinger equation: an unknown potential in a bounded domain is uniquely determined by exterior measurements of solutions. We also show global uniqueness in the partial…
The original Calder\'on problem consists in recovering the potential (or the conductivity) from the knowledge of the related Neumann to Dirichlet map (or Dirichlet to Neumann map). Here, we first perturb the medium by injecting small-scaled…
The classical Calder\'on problem with partial data is known to be log-log stable in some special cases, but even the uniqueness problem is open in general. We study the partial data stability of an analogous inverse fractional conductivity…
Uniqueness in the Calder\'on problem in dimension bigger than two was usually studied under the assumption that conductivity has bounded gradient. For conductivities with unbounded gradients uniqueness results have not been known until…
The first part of this work established the foundations of a radial duality between nonnegative optimization problems, inspired by the work of (Renegar, 2016). Here we utilize our radial duality theory to design and analyze projection-free…
We outline an approach to the inverse problem of Calder\'on that highlights the role of microlocal normal forms and propagation of singularities and extends a number of earlier results also in the anisotropic case. The main result states…
We consider a class of structured fractional minimization problems, in which the numerator part of the objective is the sum of a differentiable convex function and a convex non-smooth function, while the denominator part is a convex or…
The common approach to radial distortion is by the means of polynomial approximation, which introduces distortion-specific parameters into the camera model and requires estimation of these distortion parameters. The task of estimating…
Convex optimization problems with staged structure appear in several contexts, including optimal control, verification of deep neural networks, and isotonic regression. Off-the-shelf solvers can solve these problems but may scale poorly. We…
We introduce a method of solving inverse boundary value problems for wave equations on Lorentzian manifolds, and show that zeroth order coefficients can be recovered under certain curvature bounds. The set of Lorentzian metrics satisfying…