Related papers: Random Function Iterations for Stochastic Fixed Po…

In the Monte Carlo (MC) method statistical noise is usually present. Statistical noise may become dominant in the calculation of a distribution, usually by iteration, but is less Important in calculating integrals. The subject of the…

This paper presents a comprehensive analysis of a broad range of variations of the stochastic proximal point method (SPPM). Proximal point methods have attracted considerable interest owing to their numerical stability and robustness…

In this paper, we introduce two new modified inertial Mann Halpern and viscosity algorithms for solving fixed point problems. We establish strong convergence theorems under some suitable conditions. Finally, our algorithms are applied to…

The Griddy Gibbs sampling was proposed by Ritter and Tanner (1992) as a computationally efficient approximation of the well-known Gibbs sampling method. The algorithm is simple and effective and has been used successfully to address…

In this brief note, we investigate some constructions of Lyapunov functions for stochastic discrete-time stabilizable dynamical systems, in other words, controlled Markov chains. The main question here is whether a Lyapunov function in some…

(I.) We consider generalizations of an iterated function system and the associated Markov operators. A Markov operator, defined on the space of (deficient) topological measures on a locally compact space, is an infinite convex linear…

In this paper we consider the unconstrained minimization problem of a smooth function in ${\mathbb{R}}^n$ in a setting where only function evaluations are possible. We design a novel randomized derivative-free algorithm --- the stochastic…

This paper is a survey of methods for solving smooth (strongly) monotone stochastic variational inequalities. To begin with, we give the deterministic foundation from which the stochastic methods eventually evolved. Then we review methods…

We study the convergence of an inexact version of the classical Krasnosel'skii-Mann iteration for computing fixed points of nonexpansive maps. Our main result establishes a new metric bound for the fixed-point residuals, from which we…

It is known that Iterated Function Systems generated by orientation preserving homeomorphisms of the unit interval admit a unique invariant measure on $(0,1)$. The setup for this result is the positivity of Lyapunov exponents at both fixed…

Alternative iterative methods for a nonexpansive mapping in a Banach space are proposed and proved to be convergent to a common solution to a fixed point problem and a variational inequality. We give rates of asymptotic regularity for such…

Stochastic gradient methods are the workhorse (algorithms) of large-scale optimization problems in machine learning, signal processing, and other computational sciences and engineering. This paper studies Markov chain gradient descent, a…

We introduce and study the convergence properties of a projection-type algorithm for solving the variational inequality problem for point-to-set operators. No monotoni\-city assumption is used in our analysis. The operator defining the…

In this paper, we study Markovian random iterations of maps on standard measurable spaces. We establish a one-to-one correspondence between stationary measures and a certain class of invariant measures of a Markovian random iteration,…

We describe a general approach to the theory of self consistent transfer operators. These operators have been introduced as tools for the study of the statistical properties of a large number of all to all interacting dynamical systems…

In this paper, we revisit the computation of controlled invariant sets for linear discrete-time systems through a trajectory-based viewpoint. We begin by introducing the notion of convex feasible points, which provides a new…

Verification of infinite-state Markov chains is still a challenge despite several fruitful numerical or statistical approaches. For decisive Markov chains, there is a simple numerical algorithm that frames the reachability probability as…

Inverse problems consist of recovering a signal from a collection of noisy measurements. These problems can often be cast as feasibility problems; however, additional regularization is typically necessary to ensure accurate and stable…

We present for the first time an asymptotic convergence analysis of two time-scale stochastic approximation driven by "controlled" Markov noise. In particular, the faster and slower recursions have non-additive controlled Markov noise…

We address the reachability problem for continuous-time stochastic dynamic systems. Our objective is to present a unified framework that characterizes the reachable set of a dynamic system in the presence of both stochastic disturbances and…