Related papers: Mean Value-Mann Iterative Process

Consider a mean-reverting equation, generalized in the sense it is driven by a 1-dimensional centered Gaussian process with H\"older continuous paths on $[0,T]$ ($T > 0$). Taking that equation in rough paths sense only gives local existence…

In this paper we present an efficient iterative method of order six for the inclusion of the inverse of a given regular matrix. To provide the upper error bound of the outer matrix for the inverse matrix, we combine point and interval…

The problem of determining the (least) fixpoint of (higher-dimensional) functions over the non-negative reals frequently occurs when dealing with systems endowed with a quantitative semantics. We focus on the situation in which the…

This paper presents a way of solving Markov Decision Processes that combines state abstraction and temporal abstraction. Specifically, we combine state aggregation with the options framework and demonstrate that they work well together and…

We build on a recently introduced geometric interpretation of Markov Decision Processes (MDPs) to analyze classical MDP-solving algorithms: Value Iteration (VI) and Policy Iteration (PI). First, we develop a geometry-based analytical…

This paper introduces a general framework for iterative optimization algorithms and establishes under general assumptions that their convergence is asymptotically geometric. We also prove that under appropriate assumptions, the rate of…

In this paper we investigate the convergence for the mean curvature flow of closed submanifolds with arbitrary codimension in space forms. Particularly, we prove that the mean curvature flow deforms a closed submanifold satisfying a…

In this paper, we obtain rates of metastability for the Tikhonov-Mann iteration for countable families of mappings in CAT(0) spaces. This iteration was recently defined by the author in the setting of W-hyperbolic spaces as a generalization…

Over a bounded strictly convex domain in $\mathbb{R}^n$ with smooth boundary, we establish a priori gradient estimate for an anisotropic mean curvature flow with prescribed contact angle and Neumann boundary conditions. The estimates…

Volume or statistical averaging of the microscopic Maxwell equations (MEs), i.e. transition from microscopic MEs to their macroscopic counterparts, is one of the main steps in electrodynamics of materials. In spite of the fundamental…

We consider linear inverse problems where the solution is assumed to have a sparse expansion on an arbitrary pre-assigned orthonormal basis. We prove that replacing the usual quadratic regularizing penalties by weighted l^p-penalties on the…

In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of this algorithm. We use standard techniques from matrix theory…

In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be…

In this paper, we study the problem of testing the mean vectors of high dimensional data in both one-sample and two-sample cases. The proposed testing procedures employ maximum-type statistics and the parametric bootstrap techniques to…

In [C.W. Gear, T.J. Kaper, I.G. Kevrekidis, and A. Zagaris, Projecting to a Slow Manifold: Singularly Perturbed Systems and Legacy Codes, SIAM J. Appl. Dyn. Syst. 4 (2005) 711-732], we developed a class of iterative algorithms within the…

Motivated by the extensive application of approximate gradients in machine learning and optimization, we investigate inexact subgradient methods subject to persistent additive errors. Within a nonconvex semialgebraic framework, assuming…

We assign some kind of invariant manifolds to a given integrable PDE (its discrete or semi-discrete variant). First, we linearize the equation around its arbitrary solution $u$. Then we construct a differential (respectively, difference)…

Some iterative techniques are defined to solve reversible inverse problems and a common formulation is explained. Numerical improvements are suggested and tests validate the methods.

Mond and Pecaric proposed a powerful method, namd as MP method, to deal with operator inequalities. However, this method requires a real-valued function to be convex or concave, and the normalized positive linear map between Hilbert spaces.…

In this paper, we present a convergence rate analysis for the inexact Krasnosel'skii-Mann iteration built from nonexpansive operators. Our results include two main parts: we first establish global pointwise and ergodic iteration-complexity…