Related papers: Using Landweber method to quantify source conditio…
Using measure theoretic arguments, we provide a general framework for describing and studying the general linear inverse dispersion problem where no a priori assumptions on the source function has been made. We investigate the source-sensor…
Two main aims of this paper are to develop a numerical method to solve an inverse source problem for parabolic equations and apply it to solve a nonlinear coefficient inverse problem. The inverse source problem in this paper is the problem…
A fundamental class of matrix optimization problems that arise in many areas of science and engineering is that of quadratic optimization with orthogonality constraints. Such problems can be solved using line-search methods on the Stiefel…
In this paper we study a second order dynamical system with variable coefficients in connection to the minimization problem of a smooth nonconvex function. The convergence of the trajectories generated by the dynamical system to a critical…
We study an inverse source scattering problem for the Schr\"odinger equation with a quadratic nonlinearity. In general, uniqueness of inverse source problems can not be guaranteed at a fixed energy. Therefore, additional information is…
This paper concerns the inverse random source problem of the stochastic Maxwell equations driven by white noise in an inhomogeneous background medium. The well-posedness is established for the direct source problem, and the estimates and…
We consider minimization problems with the well-known Polya-Lojasievich condition and Lipshitz-continuous gradient. Such problem occurs in different places in machine learning and related fields. Furthermore, we assume that a gradient is…
Ill-posed linear inverse problems appear frequently in various signal processing applications. It can be very useful to have theoretical characterizations that quantify the level of ill-posedness for a given inverse problem and the degree…
In 1963, Polyak proposed a simple condition that is sufficient to show a global linear convergence rate for gradient descent. This condition is a special case of the \L{}ojasiewicz inequality proposed in the same year, and it does not…
In this work we derive higher order error estimates for inverse problems distorted by non-additive noise, in terms of Bregman distances. The results are obtained by means of a novel source condition, inspired by the dual problem.…
We propose a numerical method to solve an inverse source problem of computing the initial condition of hyperbolic equations from the measurements of Cauchy data. This problem arises in thermo- and photo- acoustic tomography in a bounded…
In a stochastic noise setting the Lepskij balancing principle for choosing the regularization parameter in the regularization of inverse problems is depending on a parameter $\tau$ which in the currently known proofs is depending on the…
The conditioning and accuracy of various inverse surface-source formulations are investigated. First, the normal systems of equations are discussed. Second, different implementations of the zero-field condition are analyzed regarding their…
The wave equation on a bounded domain of $\R^{n}$ with non homogeneous boundary Dirichlet data or sources supported on a subset of the boundary is considered. We analyze the problem of observing the source out of boundary measurements done…
A quality-Bayesian approach, combining the direct sampling method and the Bayesian inversion, is proposed to reconstruct the locations and intensities of the unknown acoustic sources using partial data. First, we extend the direct sampling…
In this article, we improve the classical Bukhgeim-Klibanov method presented in [1],which can be used to prove the conditional stability of inverse source problem for a hyperbolic equation from the measurement on the subboundary. A major…
The asymptotic analysis of a generic stochastic optimization algorithm mainly relies on the establishment of a specific descent condition. While the convexity assumption allows for technical shortcuts and generally leads to strict…
In this note, we consider the line search for a class of abstract nonconvex algorithm which have been deeply studied in the Kurdyka-Lojasiewicz theory. We provide a weak convergence result of the line search in general. When the objective…
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: $L(x,y)=f(x)+Q(x,y)+g(y)$, where $f:\R^n\rightarrow\R\cup{+\infty}$ and $g:\R^m\rightarrow\R\cup{+\infty}$…
We consider parameter identification problems in parametrized partial differential equations (PDE). This leads to nonlinear ill-posed inverse problems. One way to solve them are iterative regularization methods, which typically require…