I am reading this paper related to an algorithm for nonsmooth optimization problems. After many simplifications, I was able to formalize the method as follows: let $\Bbb B $ denote the unit ball in $\Bbb R^n$ and consider a set $D\subseteq \Bbb B.$ We have an operator $T: \Bbb R^n \times D \to \Bbb R^n,$ and the probability space $(\Bbb B, \mathcal{B}|_{\Bbb B}, \mu),$ where

• $\mathcal{B}|_{\Bbb B}$ denotes the Borel sigma algebra in $\Bbb R^n$ restricted to the unit ball

• $\mu$ is the Lebesgue measure restricted to $\Bbb B$ scaled so that it is a probability measure, i.e, for $B\in \mathcal{B}|_{\Bbb B},$ $$\mu(B):=\frac{\mu'(B)}{\mu'(\Bbb B)},$$ and $\mu'$ is the Lebesgue measure in $\Bbb R^n.$ Furthermore, we have that $\mu(D)=\mu (B).$

The algorithm is then as follows:

• Step 0: Take $x^0\in \Bbb R^n,\; k=0.$

• Step 1: Sample $u^k$ from $\Bbb B$ according to the probability space described. If $u^k \notin D:$ Stop, return $x^k.$ Else, go to Step 2

• Step 2: Take $x^{k+1}:= T(x^k, u^k),\; k=k+1.$ Go to Step 1.

The main result of the paper states that:

• With probability one, the method above never stops and every accumulation point of the generated sequence belongs to a set $S$ (of stationary points).

I am not able to formalize this statement in order to attempt a proof by myself due to the following questions:

1. According to such statement, the set

$$A:= \{\{x^k\}: \{x^k\} \textrm{ is generated by the method(that does not stop) and every accumulation point belongs to } S\}$$ is an event in some probability space $(X,\mathcal{A},\nu)$ with $nu(A)=1.$

Who is $(X,\mathcal{A},\nu)$? In the paper, this is not explained because it seems not to be needed.

2. If you don't need the definition of $(X,\mathcal{A},\nu),$ is there a branch of probability theory that is devoted to the study of these types of statements? To my little knowledge, this seems to be related to stochastic processes or random walks.

Thanks to all in advance.

I am reading this paper related to an algorithm for nonsmooth optimization problems. After many simplifications, I was able to formalize the method as follows: let $\Bbb B $ denote the unit ball in $\Bbb R^n$ and consider a set $D\subseteq \Bbb B.$ We have an operator $T: \Bbb R^n \times D \to \Bbb R^n,$ and the probability space $(\Bbb B, \mathcal{B}|_{\Bbb B}, \mu),$ where

• $\mathcal{B}|_{\Bbb B}$ denotes the Borel sigma algebra in $\Bbb R^n$ restricted to the unit ball

• $\mu$ is the Lebesgue measure restricted to $\Bbb B$ scaled so that it is a probability measure, i.e, for $B\in \mathcal{B}|_{\Bbb B},$ $$\mu(B):=\frac{\mu'(B)}{\mu'(\Bbb B)},$$ and $\mu'$ is the Lebesgue measure in $\Bbb R^n.$ Furthermore, we have that $\mu(D)=\mu (\Bbb B).$

The algorithm is then as follows:

• Step 0: Take $x^0\in \Bbb R^n,\; k=0.$

• Step 1: Sample $u^k$ from $\Bbb B$ according to the probability space described. If $u^k \notin D:$ Stop, return $x^k.$ Else, go to Step 2

• Step 2: Take $x^{k+1}:= T(x^k, u^k),\; k=k+1.$ Go to Step 1.

The main result of the paper states that:

• With probability one, the method above never stops and every accumulation point of the generated sequence belongs to a set $S$ (of stationary points).

I am not able to formalize this statement in order to attempt a proof by myself due to the following questions:

1. According to such statement, the set

$$A:= \{\{x^k\}: \{x^k\} \textrm{ is generated by the method(that does not stop) and every accumulation point belongs to } S\}$$ is an event in some probability space $(X,\mathcal{A},\nu)$ with $\nu(A)=1.$

Who is $(X,\mathcal{A},\nu)$? In the paper, this is not explained because it seems not to be needed.

2. If you don't need the definition of $(X,\mathcal{A},\nu),$ is there a branch of probability theory that is devoted to the study of these types of statements? To my little knowledge, this seems to be related to stochastic processes or random walks.

Thanks to all in advance.