The study of fixed points of single-valued self-mappings or multivalued self-mappings satisfying certain contraction conditions has a great majority of results inmetric fixed point theory. All these results are mainly generalizations of Banach contraction principle. The Banach contraction principle guarantees the existence and uniqueness of fixed points of certain self-maps in complete metric s...

In the present paper‎, ‎we introduce the concept of generalized multivalued $F$ -‎contraction mappings and give a fixed point result‎, ‎which is a proper‎ ‎generalization of some multivalued fixed point theorems including Nadler's‎.

The proximal point algorithm (PPA) is classical, and the resulting proximal subproblems may be as difficult as the original problem. In this paper, we show that with appropriate choices of proximal parameters, the application of PPA to the linearly constrained convex programming can result in easy proximal subproblems. In particular, under some practical assumptions on the objective function, t...

In this paper we introduce the concept of generalized weakly contractiveness for a pair of multivalued mappings in a metric space. We then prove the existence of a common fixed point for such mappings in a complete metric space. Our result generalizes the corresponding results for single valued mappings proved by Zhang and Song [14], as well as those proved by D. Doric [4].

The role of pelvic floor muscle contraction in the genesis of anal canal pressure is not clear. Recent studies have suggested that vaginal distension increases pelvic floor muscle contraction. We studied the effects of vaginal distension on anal canal pressure in 15 nullipara asymptomatic women. Anal pressure, rest, and squeeze were measured using station pull-through manometry techniques with ...

In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for γP,k(G − e), γP,k(G/e) and for γP,k(G − v) in terms of γP,k(G), and give examples for which these bounds are tight. We characterize all graphs for which γP,k(G− e) = γP,k(G) + 1 for any edge e...