Related papers: Convergence of the conjugate gradient method with …
We prove rate of convergence results for singular perturbations of Hamilton-Jacobi equations in unbounded spaces where the fast operator is linear, uniformly elliptic and has an Ornstein-Uhlenbeck-type drift. The slow operator is a fully…
The considered problem is uniform convergence of sequences of hypergeometric series. We give necessary and sufficient conditions for uniformly dominated convergence of infinite sums of proper bivariate hypergeometric terms. These conditions…
We prove statistical rates of convergence for kernel-based least squares regression from i.i.d. data using a conjugate gradient algorithm, where regularization against overfitting is obtained by early stopping. This method is related to…
We incorporate inertial terms in the hybrid proximal-extragradient algorithm and investigate the convergence properties of the resulting iterative scheme designed for finding the zeros of a maximally monotone operator in real Hilbert…
The resolvent convergence of self-adjoint operators via the technique of $\Gamma$-convergence of quadratic forms is adapted to incorporate complex Hilbert spaces. As an application, we find effective operators to the Dirichlet Laplacian…
In the framework of abstract linear inverse problems in infinitedimensional Hilbert space we discuss generic convergence behaviours of approximate solutions determined by means of general projection methods, namely outside the standard…
The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…
We present a version of the equivariant gradient degree defined for equivariant gradient perturbations of an equivariant unbounded self-adjoint operator with purely discrete spectrum in Hilbert space. Two possible applications are…
Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several…
This article deals with the conjugate gradient method on a Riemannian manifold with interest in global convergence analysis. The existing conjugate gradient algorithms on a manifold endowed with a vector transport need the assumption that…
Given a finite collection $\mathbf{V}:=(V_1,\dots,V_N)$ of closed linear subspaces of a real Hilbert space $H$, let $P_i$ denote the orthogonal projection operator onto $V_i$ and $P_{i,\lambda}:= (1-\lambda)I + \lambda P_i$ denote its…
We analyze convergence of the Levenberg-Marquardt method for solving nonlinear inverse problems in Hilbert spaces. Specifically, we establish local convergence and convergence rates for a class of inverse problems that satisfy H\"{o}lder…
We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…
We prove that the number of iterations required to solve a random positive definite linear system with the conjugate gradient algorithm is almost deterministic for large matrices. We treat the case of Wishart matrices $W = XX^*$ where $X$…
In this paper, we establish results about operators similar to their adjoints. This is carried out in the setting of bounded and also unbounded operators on a Hilbert space. Among the results, we prove that an unbounded closed operator…
In recent years, a series of convergence rates conditions for regularization methods has been developed. Mainly, the motivations for developing novel conditions came from the desire to carry over convergence rates results from the Hilbert…
In this paper we prove the strong convergence of the explicit iterative process to a common fixed point of the finite family of nonexpansive mappings defined on Hilbert space, which solves the the variational inequality on the fixed points…
We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…
In this paper, first we introduce a new mapping for finding a common fixed point of an infinite family of nonexpansive mappings then we consider iterative method for finding a common element of the set of fixed points of an infinite family…
We consider a class of statistical inverse problems involving the estimation of a regression operator from a Polish space to a separable Hilbert space, where the target lies in a vector-valued reproducing kernel Hilbert space induced by an…