This paper demonstrates a customized application of the classical proximal point algorithm (PPA) to the convex minimization problem with linear constraints. We show that if the proximal parameter in metric form is chosen appropriately, the application of PPA could be effective to exploit the...

An implicit algorithm for finding common fixed points of an uncountable family of nonexpansive mappings is proposed. A new inexact iteration method is also proposed for countable family of nonexpansive mappings. Several strong convergence theorems based on our main results are established in the...

We study optimal stopping with exponentially distributed exercise lag. We formalize the problem first in a general Markovian setting and derive a set of conditions under which the solution exists. In particular, no semicontinuity assumptions of the payoff function are needed. We analyze also...