A fixed-point theorem on compact compositions of acyclic maps on admissible (in the sense of Klee) convex subset of a t.v.s. is applied to obtain a cyclic coincidence theorem for acyclic maps, generalized “onNeumann type intersection theorems, the Nash type equilibrium theorems, and the “onNeumann minimax theorem. Our new results generalize earlier works of Lassonde [l], Simons [2], and Park [3...

‎The proximal point algorithm‎, ‎which is a well-known tool for finding‎ ‎minima of convex functions‎, ‎is generalized from the classical‎ ‎Hilbert space framework into a nonlinear setting‎, ‎namely‎, ‎geodesic‎ ‎metric spaces of nonpositive curvature‎. ‎In this paper we propose an‎  ‎iterative algorithm for finding the common element of the‎ ‎minimizers of a finite family of convex functions a...

Given a discrete-time random dynamical system represented by cocycle of non-singular measurable maps, we may obtain information on quantities studying the Perron–Frobenius operators associated to maps. Of particular interest is second-largest Lyapunov exponent for operators, λ2, which can tell us about mixing rates and decay correlations in system. We prove generalized theorem cocycles bounded ...

We introduce a hybrid projection-localization method for solving large convex cone programs. The method interleaves a series of projections onto localization sets with the classical alternating projections method for convex feasibility problems; the problem is made amenable to the method by reducing it to a convex feasibility problem composed of a subspace and a cone via its homogeneous self-du...

Huang and Zhang cite{Huang} have introduced the concept of cone metric space where the set of real numbers is replaced by an ordered Banach space. Shojaei cite{shojaei} has obtained points of coincidence and common fixed points for s-Contraction mappings which satisfy generalized contractive type conditions in a complete cone metric space.In this paper, the notion of complete cone metric ...

We consider a general multiobjective optimization problem with five basic optimality principles: efficiency, weak and proper Pareto optimality, strong efficiency and lexicographic optimality. We generalize the concept of tradeoff directions defining them as some optimal surface of appropriate cones. In convex optimization, the contingent cone can be used for all optimality principles except lex...

It is known that complementarity functions play an important role in dealing with complementarity problems. The most well known complementarity problem is the symmetric cone complementarity problem (SCCP) which includes nonlinear complementarity problem (NCP), semidefinite complementarity problem (SDCP), and second-order cone complementarity problem (SOCCP) as special cases. Moreover, there is ...

In this paper, we introduce the concept of generalized quasi-contractions in the setting of cone $b$-metric spaces over Banach algebras. By omitting the  assumption of normality we establish common fixed point theorems for the generalized quasi-contractions  with the spectral radius $r(lambda)$ of the quasi-contractive constant vector $lambda$ satisfying $r(lambda)in [0,frac{1}{s})$  in the set...