Let G be a bounded convex set, and H G the projection onto G, and {~j} a bounded random process. Projected algorithms of the types X~ + 1 = H~(X~ + ~ b (X~, ~,)) (or X n + 1 = He(X, + a, b (Xn, in)), where 0 < a n ~ 0, Z a, = oo) occur frequently in applications (among other places) in control and communications theory. The asymptotic convergence properties of {X~} as e~0, en~ 0% have been well analyzed in the literature. Here, we use large deviations methods to get a more thorough understanding of the global behavior. Let O be a stable point of the algorithm in the sense that X~ ~ O in distribution as e--* 0, n e ~ oo. For the unconstrained case, rate of convergence results involve showing asymptotic normality of {(X~-O)/lfe }, and use linearizations about O. In the constrained case O is often on β’G, and such methods are inapplicable. But the large deviations method yields an alternative which is often more useful in the applications. The action functionals are derived and their properties (lower semicontinuity, etc.) are obtained. The statistics (mean value, etc.) of the escape times from a neighborhood of O are obtained, and the global behavior on the infinite interval is described.