相关论文: On Strong convergence of Halpern's method using av…
Here, we study the periodic homogenization problem of nonlinear weakly coupled systems of Hamilton-Jacobi equations in the convex setting. We establish a rate of convergence $O(\sqrt{\varepsilon})$ which is sharp.
In this work we address the analysis of the stationary generalized Burgers-Huxley equation (a nonlinear elliptic problem with anomalous advection) and propose conforming, nonconforming and discontinuous Galerkin finite element methods for…
We describe a framework in which is possible to develop and implement algorithms for the approximation of invariant measures of dynamical systems with a given bound on the error of the approximation. Our approach is based on a general…
Local convergence analysis of the proximal point method for special class of nonconvex function on Hadamard manifold is presented in this paper. The well definedness of the sequence generated by the proximal point method is guaranteed.…
We show that the super fixed point property for nonexpansive mappings and for asymptotically nonexpansive mappings in the intermediate sense are equivalent. As a consequence, we obtain fixed point theorems for asymptotically nonexpansive…
We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Douglas-Rachford or Averaged Alternating Reflection Algorithm…
In this paper, some results on the existence of n-tuplet fixed points for multi-valued contraction mappings are proved via measure of noncompactness. As an application, the existence of solutions for a system of integral inclusions is…
The problem of minimizing the sum of nonsmooth, convex objective functions defined on a real Hilbert space over the intersection of fixed point sets of nonexpansive mappings, onto which the projections cannot be efficiently computed, is…
This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods for nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a…
We present Bayesian techniques for solving inverse problems which involve mean-square convergent random approximations of the forward map. Noisy approximations of the forward map arise in several fields, such as multiscale problems and…
Many iterative methods in optimization are fixed-point iterations with averaged operators. As such methods converge at an $\mathcal{O}(1/k)$ rate with the constant determined by the averagedness coefficient, establishing small averagedness…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
The purpose of this article is to study Lipschitz CR mappings from an $h$-extendible (or semi-regular) hypersurface in $\mbb C^n$. Under various assumptions on the target hypersurface, it is shown that such mappings must be smooth. A…
In this note we apply a lemma due to Sabach and Shtern to compute linear rates of asymptotic regularity for Halpern-type nonlinear iterations studied in optimization and nonlinear analysis.
Suppose a $k$-uniform hypergraph $H$ that satisfies a certain regularity instance (that is, there is a partition of $H$ given by the hypergraph regularity lemma into a bounded number of quasirandom subhypergraphs of prescribed densities).…
In this article we study fine regularity properties for mappings of finite distortion. Our main theorems yield strongly localized regularity results in the borderline case in the class of maps of exponentially integrable distortion.…
We have derived that on certain Banach spaces having a graph structure $G$, the iterations for asymptotically $G$-nonexpansive map will converge weakly towards a fixed point. This result unifies and extends several theorems on fixed points…
Point source localisation is generally modelled as a Lasso-type problem on measures. However, optimisation methods in non-Hilbert spaces, such as the space of Radon measures, are much less developed than in Hilbert spaces. Most numerical…
Proximal splitting algorithms for monotone inclusions (and convex optimization problems) in Hilbert spaces share the common feature to guarantee for the generated sequences in general weak convergence to a solution. In order to achieve…
We show that for any quasimeromorphic mapping with an essential singularity at infinity, there exist points whose iterates tend to infinity arbitrarily slowly. This extends a result by Nicks for quasiregular mappings, and Rippon and…