Many useftil descriptions of stochastic models can be obtained from functional limit theorems (invariance principles or weak convergence theorems for probability meastires on function ŝpaces). These descriptions typically come from standard functional limit theorems via the o^ntinuous mapping theorem. This paper facilitates applications of the continuous mapping theorem by determining when seve...

A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond–Weir type dual relating properly efficient solutions of the primal and dual problems.

We prove common fixed point theorems for two pairs of hybrid mappings satisfying implicit relations in complete metric spaces using the concept of R−weak commutativity of type AT and we correct errors of [1], [3] and [8]. Our theorems generalize results of [1-3], [8], [12-16] and [21].

In this paper, we prove some strong and weak convergence theorems using a modified iterative process for nonself asymptotically nonexpansive mappings in a uniformly convex Banach space. This will improve and generalize the corresponding results in the existing literature. Finally, we will state that our theorems can be generalized to the case of finitely many mappings. c © 2007 Elsevier Ltd. Al...

In this paper we have considered a non convex optimal control problem and presented the weak, strong and converse duality theorems. The optimality conditions and duality theorems for fractional generalized minimax programming problem are established. With a parametric approach, the functions are assumed to be pseudo-invex and v-invex.

In this paper, several weak and strong convergence theorems are established for a new modified iterations with errors for finite family of nonself asymptotically nonexpansive mappings in Banach spaces. Mann-type, Ishikawa-type and Noor-type iterations are covered by the new iteration scheme. Our convergence theorems improve, unify and generalize many important results in the current literatures.

We study a Curie-Weiss model with a random external field generated by a dynamical system. Probabilistic limit theorems (weak law of large numbers, central limit theorems) are proven for the corresponding magnetization. Our results extend those already obtained in [7] and [8].

In this paper, we introduce two kinds of iterative algorithms for finding zeroes of maximal monotone operators, and establish strong and weak convergence theorems of the modified proximal point algorithms. By virtue of the established theorems, we consider the problem of finding a minimizer of a convex function. Mathematics Subject Classification: Primary 47H17; Secondary 47H05, 47H10

Let f n (; !) be a sequence of stochastic processes which converge weakly to a limit process f 0 (; !). We show under some assumptions the weak inclusion of the solution sets n (!) = f : f n (; !) = 0g in the limiting solution set 0 (!) = f : f 0 (; !) = 0g. If the limiting solutions are a.s. singletons, then weak convergence holds. Results of his type are called Z-theorems (Zero-theorems). Mor...

Choice functions on tournaments always select the maximal element (Condorcet winner), provided they exist, but this property does not hold in the more general case of weak tournaments. In this paper we analyze the relationship between the usual choice functions and the set of maximal elements in weak tournaments. We introduce choice functions selecting maximal elements, whenever they exist. Mor...