Searcharxiv⌕ Search

arXiv subjects

Qinian Jin

Publications and source records attributed to Qinian Jin.

31 records · Page 2Linked to original sources
arXiv2014

Nonstationary iterated Tikhonov regularization in Banach spaces with uniformly convex penalty terms

We consider the nonstationary iterated Tikhonov regularization in Banach spaces which defines the iterates via minimization problems with uniformly convex penalty term. The penalty term is allowed to be non-smooth to include $L^1$ and total variation (TV) like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and discontinuities in practical applications. We present the detailed convergence analysis and obtain the regularization property when the method is terminated by the discrepancy principle. In particular we establish the strong convergence and the convergence in Bregman distance which sharply contrast with the known results that only provide weak convergence for a subsequence of the iterative solutions. Some numerical experiments on linear integral equations of first kind and parameter identification in differential equations are reported.

math.NA↗
arXiv2013

Landweber iteration of Kaczmarz type with general non-smooth convex penalty functionals

The determination of solutions of many inverse problems usually requires a set of measurements which leads to solving systems of ill-posed equations. In this paper we propose the Landweber iteration of Kaczmarz type with general uniformly convex penalty functional. The method is formulated by using tools from convex analysis. The penalty term is allowed to be non-smooth to include the $L^1$ and total variation (TV) like penalty functionals, which are significant in reconstructing special features of solutions such as sparsity and piecewise constancy in practical applications. Under reasonable conditions, we establish the convergence of the method. Finally we present numerical simulations on tomography problems and parameter identification in partial differential equations to indicate the performance.

math.NA↗
arXiv2013

On the iteratively regularized Gauss--Newton method in Banach spaces with applications to parameter identification problems

In this paper we propose an extension of the iteratively regularized Gauss--Newton method to the Banach space setting by defining the iterates via convex optimization problems. We consider some a posteriori stopping rules to terminate the iteration and present the detailed convergence analysis. The remarkable point is that in each convex optimization problem we allow non-smooth penalty terms including $L^1$ and total variation (TV) like penalty functionals. This enables us to reconstruct special features of solutions such as sparsity and discontinuities in practical applications. Some numerical experiments on parameter identification in partial differential equations are reported to test the performance of our method.

math.NA↗
arXiv2012

Oracle inequality for a statistical Raus-Gfrerer type rule

The authors study statistical linear inverse problems in Hilbert spaces. Approximate solutions are sought within a class of linear one-parameter regularization schemes, and the parameter choice is crucial to control the root mean squared error. Here a variant of the Raus{Gfrerer rule is analyzed, and it is shown that this parameter choice gives rise to error bounds in terms of oracle inequalities, which in turn provide order optimal error bounds (up to logarithmic factors). These bounds can only be established for solutions which obey a certain self-similarity structure. The proof of the main result relies on some auxiliary error analysis for linear inverse problems under general noise assumptions, and this may be interesting in its own.

math.NA↗
arXiv2011

On the order optimality of the regularization via inexact Newton iterations

Inexact Newton regularization methods have been proposed by Hanke and Rieder for solving nonlinear ill-posed inverse problems. Every such a method consists of two components: an outer Newton iteration and an inner scheme providing increments by regularizing local linearized equations. The method is terminated by a discrepancy principle. In this paper we consider the inexact Newton regularization methods with the inner scheme defined by Landweber iteration, the implicit iteration, the asymptotic regularization and Tikhonov regularization. Under certain conditions we obtain the order optimal convergence rate result which improves the suboptimal one of Rieder. We in fact obtain a more general order optimality result by considering these inexact Newton methods in Hilbert scales.

math.NA↗
arXiv2010

A general convergence analysis on inexact Newton method for nonlinear inverse problems

We consider the inexact Newton methods $$ x_{n+1}^\d=x_n^\d-g_{\a_n}(F'(x_n^\d)^* F'(x_n^\d)) F'(x_n^\d)^* (F(x_n^\d)-y^\d) $$ for solving nonlinear ill-posed inverse problems $F(x)=y$ using the only available noise data $y^\d$ satisfying $\|y^\d-y\|\le \d$ with a given small noise level $\d>0$. We terminate the iteration by the discrepancy principle $$ \|F(x_{n_\d}^\d)-y^\d\|\le τ\d<\|F(x_n^\d)-y^\d\|, \qquad 0\le n 1$. Under certain conditions on $\{\a_n\}$ and $F$, we prove for a large class of spectral filter functions $\{g_\a\}$ the convergence of $x_{n_\d}^\d$ to a true solution as $\d\rightarrow 0$. Moreover, we derive the order optimal rates of convergence when certain Hölder source conditions hold. Numerical examples are given to test the theoretical results.

math.NA↗
arXiv2010

Implicit iteration methods in Hilbert scales under general smoothness conditions

For solving linear ill-posed problems regularization methods are required when the right hand side is with some noise. In the present paper regularized solutions are obtained by implicit iteration methods in Hilbert scales. % By exploiting operator monotonicity of certain functions and interpolation techniques in variable Hilbert scales, we study these methods under general smoothness conditions. Order optimal error bounds are given in case the regularization parameter is chosen either {\it a priori} or {\it a posteriori} by the discrepancy principle. For realizing the discrepancy principle, some fast algorithm is proposed which is based on Newton's method applied to some properly transformed equations.

math.NA↗
arXiv2008

On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems

We consider the computation of stable approximations to the exact solution $x^†$ of nonlinear ill-posed inverse problems $F(x)=y$ with nonlinear operators $F:X\to Y$ between two Hilbert spaces $X$ and $Y$ by the Newton type methods $$ x_{k+1}^δ=x_0-g_{α_k} (F'(x_k^δ)^*F'(x_k^δ)) F'(x_k^δ)^* (F(x_k^δ)-y^δ-F'(x_k^δ)(x_k^δ-x_0)) $$ in the case that only available data is a noise $y^δ$ of $y$ satisfying $\|y^δ-y\|\le δ$ with a given small noise level $δ>0$. We terminate the iteration by the discrepancy principle in which the stopping index $k_δ$ is determined as the first integer such that $$ \|F(x_{k_δ}^δ)-y^δ\|\le τδ<\|F(x_k^δ)-y^δ\|, \qquad 0\le k 1$. Under certain conditions on $\{α_k\}$, $\{g_α\}$ and $F$, we prove that $x_{k_δ}^δ$ converges to $x^†$ as $δ\to 0$ and establish various order optimal convergence rate results. It is remarkable that we even can show the order optimality under merely the Lipschitz condition on the Fréchet derivative $F'$ of $F$ if $x_0-x^†$ is smooth enough.

math.NA↗
arXiv2007

Symmetry and Asymmetry: The Method of Moving Spheres

We consider some nonlinear elliptic equations on ${\mathbb R}^n$ and ${\mathbb S}^n$. By the method of moving spheres, we obtain the symmetry properties of solutions and some nonexistence results. Moreover, by the global bifurcation theory, we obtain a multiplicity result for a class of semilinear elliptic equations.

math.AP↗