Open Access

Best proximity and fixed point results for cyclic multivalued mappings under a generalized contractive condition

  • Manuel De la Sen1Email author,
  • Shyam Lal Singh2,
  • Madjid Eshaghi Gordji3,
  • Asier Ibeas4 and
  • Ravi P Agarwal5, 6
Fixed Point Theory and Applications20132013:324

https://doi.org/10.1186/1687-1812-2013-324

Received: 26 July 2013

Accepted: 5 November 2013

Published: 27 November 2013

Abstract

This paper is devoted to investigating the existence of fixed points and best proximity points of multivalued cyclic self-mappings in metric spaces under a generalized contractive condition involving Hausdorff distances. Some background results for cyclic self-mappings or for multivalued self-mappings in metric fixed point theory are extended to cyclic multivalued self-mappings. An example concerned with the global stability of a time-varying discrete-time system is also discussed by applying some of the results obtained in this paper. Such an example includes the analysis with numerical simulations of two particular cases which are focused on switched discrete-time control and integrate the associate theory in the context of multivalued mappings.

MSC:47H10, 55M20, 54H25.

Keywords

best proximity points cyclic self-mappings fixed points metric space multi-control multivalued self-mappings uniform convex Banach space

1 Introduction

Important attention is being devoted to investigation of fixed point theory for single-valued and multivalued mappings concerning some relevant properties like, for instance, stability of the iterations, fixed points of contractive and nonexpansive self-mappings and the existence of either common or coupled fixed points of several multivalued mappings or operators. See, for instance, [124] and references therein. Related problems concerning the computational aspects of iterative calculations and best approximations based on fixed point theory have been also investigated. See, for instance, [2123, 25, 26] and some references therein. On the other hand, a fixed point result for partial metric spaces and partially ordered metric spaces can be found in [2730] and [4, 15, 31, 32], respectively, and references therein.

This paper is devoted to the investigation of some properties of fixed point and best proximity point results for multivalued cyclic self-mappings under a general contractive-type condition based on the Hausdorff metric between subsets of a metric space [13, 33, 34]. This includes, as a particular case, contractive single-valued self-mappings [13, 25, 3336], and similar problems for cyclic (strictly contractive or not) self-mappings [3537] as well. Some previous results on multivalued contractions are retaken by generalizing the contractive condition and extended to cyclic multivalued self-mappings by extending the results of Đorić and Lazović in [1] (then being extended in [6] concerning results on common fixed points of a pair of multivalued maps in a complete metric space) which are based on previous Suzuki et al. and Ćirić’s results for single-valued self-mappings in some background literature papers. See, for instance, [2, 3, 33, 34] and references therein. Through this paper, we consider a metric space ( X , d ) and a multivalued 2-cyclic self-mapping T : A B A B (being simply referred to as a multivalued cyclic self-mapping in the sequel), where A and B are nonempty closed subsets of X, so that T ( A ) B and T ( B ) A and D = dist ( A , B ) 0 . Let us consider the subset of the set of real numbers R 0 + = R + { 0 } = { z 0 : z R } , R + = { z > 0 : z R } , let the symbols ‘’ and ‘’ denote the logic disjunction (‘or’) and conjunction (‘and’), and define the functions M : ( A B ) × ( B A ) × [ 0 , 1 ) × Δ R 0 + and φ : ( A B ) × ( B A ) × [ 0 , 1 ) × Δ ( 0 , 1 ] as follows:
M ( x , y , K , α , β ) = max [ M 1 ( x , y , K ) , M 2 ( x , y , α , β ) ] ,
(1.1)
M 1 ( x , y , K ) = K max { d ( x , y ) , d ( x , T x ) , d ( y , T y ) , 1 / 2 ( d ( x , T y ) + d ( y , T x ) ) } ,
(1.2a)
M 2 ( x , y , α , β ) = α d ( x , T x ) + β d ( y , T y ) ,
(1.2b)
φ ( x , y , K , α , β ) = { 1 if  ( [ ( α , β ) Δ 1 ( Δ 3 Δ 4 ) ] [ ( α , β ) Δ 2 ( Δ 3 Δ 4 ) ] ) if  ( M 2 ( x , y , α , β ) > M 1 ( x , y , K ) ) , 1 β if  ( [ ( α , β ) Δ 3 ] ) ( M 2 ( x , y , α , β ) > M 1 ( x , y , K ) ) , 1 β 1 β + α if  ( ( α , β ) Δ 4 Δ 3 ) ( M 2 ( x , y , α , β ) > M 1 ( x , y , K ) ) , 1 if  ( 0 K < 1 / 2 ) ( M 2 ( x , y , α , β ) M 1 ( x , y , K ) ) , 1 K if  ( 1 / 2 K < 1 ) ( M 2 ( x , y , α , β ) M 1 ( x , y , K ) ) ;
(1.3)
x , y ( A B ) × ( B A ) for some real constants K [ 0 , 1 ) , ( α , β ) Δ [ 0 , 1 ) × [ 0 , 1 ) , where
Δ = { ( α , β ) : α 0 , β 0 , α + β < 1 } , Δ 1 = { ( α , β ) Δ : α β , α ( 1 + α ) + β < 1 } , Δ 2 = { ( α , β ) Δ : α β , β ( 1 + β ) + α < 1 } , Δ 3 = { ( α , β ) Δ : α ( 0 , 1 / 2 ) , 1 α 2 β } , Δ 4 = { ( α , β ) Δ : α ( 1 + α ) + β ( 2 β ) 1 } .
(1.4)

Note that φ : ( A B ) × ( B A ) × [ 0 , 1 ) × Δ ( 0 , 1 ] is non-increasing since all its partial derivatives with respect to K, α, β exist and are non-positive; x , y ( A B ) × ( B A ) and note also that Δ is the union of the subsets Δ i Δ ; i = 1 , 2 , 3 , 4 .

A general contractive condition is then proposed and discussed based on the Hausdorff metric on subsets of a vector space and the constraints (1.1)-(1.4). For this purpose, some preparatory concepts are needed. Let CL ( X ) be a family of all nonempty and closed subsets of the vector space X. If A , B CL ( X ) , then we can define ( CL ( X ) , H ) as the generalized hyperspace of ( X , d ) equipped with the Hausdorff metric H : CL ( X ) R 0 +
H ( A , B ) = max { sup x A d ( x , B ) , sup y B d ( y , A ) }
(1.5)
with A X and B X being nonempty sets. The gap between the nonempty sets A and B is defined by
D = dist ( A , B ) = inf x A , y B d ( x , y ) = inf x A d ( x , B ) = inf y B d ( y , A ) 0 .
The proposed general contractive condition to be then discussed is
[ φ ( x , y , K , α , β ) d ( x , T x ) d ( x , y ) ] [ H ( T x , T y ) M ( x , y , K , α , β ) + ω D ] ,
(1.6)

where T : A B A B is a multivalued cyclic self-mapping on the subset A B of X, that is, T ( A ) B and T ( B ) A , where ( X , d ) is a complete metric space including the case that ( X , ) is a Banach space with a norm-induced metric d : X × X R 0 + , so that ( X , ) ( X , d ) is a complete metric space, is used, subject to (1.1)-(1.4), in the main result Theorem 2.1 below. In this context, Tx is the image set through T of any x A B which is in B, that is, T x T ( A ) B (respectively, T x T ( B ) A ) if x A (respectively, if x B ). It is inspired by that proposed in [34] for single-valued self-mappings while it generalizes that proposed and discussed in [1] for multivalued self-mappings which is based on the Hausdorff generalized metric.

See Figure 1 with the plots of the various involved sets Δ and Δ i Δ for i = 1 , 2 , 3 , 4 and some of their relevant subsets in the contractive condition subject to (1.1)-(1.4).
Figure 1

The sets Δ and Δ i , i = 1 , 2 , 3 , 4 .

Note that the proposed contractive condition, in fact, considers the worst case, given by the maximum of (1.1), of such a contractive condition of [1], reflected in (1.2a), with one based on a Kannan-type contractive condition associated with the choice of possible distinct values for the constants α and β, which is reflected in (1.2b) subject to (1.3)-(1.4). In particular, the choice α = β [ 0 , 1 / 2 ) gives a Kannan-type contractive condition in (1.2b). Note the importance of Kannan-type contractions for single-valued mappings in the sense that a metric space is complete if and only if each Kannan contraction has a unique fixed point [27, 38, 39]. The incorporation of (1.2b), (1.3)-(1.4) to (1.1) to build the general contractive condition allows an obvious direct generalization of the usual contractive condition, based on the Banach principle combined with a Kannan-type constraint, since both of them do not imply each other. In this context, note, for instance, that the simple scalar single-valued sequence x n + 1 = a x n ; n N 0 = N { 0 } , with initial condition x 0 R , is a strict contraction if | a | < 1 . However, it is not a Kannan contraction for all | a | < 1 . This is easily seen as follows. Check the Kannan condition d ( T x , T y ) α ( d ( x , T x ) + d ( y , T y ) ) for the self-mapping T on R defining the sequence solution and α [ 0 , 1 / 2 ) , for instance, for points x = x n , x n + 1 = T x , x n + 2 = T 2 x = y and x n + 3 = T 3 x = T y for any n N 0 . Then the Kannan contractive test is subject to 1 2 > α | a | 1 + a 2 , which is not fulfilled for given nonzero sufficiently small values of 1 > | a | > 0 and any real α [ 0 , 1 / 2 ) . It is possible also to check in a similar way a failure of the generalized Kannan-extended contractive condition d ( T x , T y ) α d ( x , T x ) + β d ( y , T y ) with 0 β < 1 α , α [ 0 , 1 ) for given nonzero sufficiently small values of 1 > | a | > 0 .

In the current approach, a combination of distinct contractive conditions for the ( α , β ) pairs of values belonging to some relevant sets constructed from the subsets Δ i ; i = 1 , 2 , 3 , 4 of Δ is itself combined with the two point-to-point possibilities of combinations of the comparisons M 2 ( x , y , α , β ) > ( or  ) M 1 ( x , y , K ) for each ( x , y ) A × B B × A . The various constraints are used to prove the convergence of the iterated sequences constructed with cyclic self-mappings T : A B A B to best proximity points. On the other hand, the use of ωD in the contractive condition, instead of the distance in-between subsets, allows via the choice of some real constant ω > 1 to deal with problems where the achievement of limits of sequences at best proximity points is not of particular interest but just their limits superior belonging to certain subsets of the relevant sets A i X ; i p ¯ containing the best proximity points. In this case, the permanence of the relevant sequences after a finite time in subsets of the sets A i X ; i p ¯ after a finite number of steps is guaranteed. The standard analysis can be used for the particular case ω = 1 . The performed study in the manuscript seems to be also promising for its extension to the study of single-valued and multivalued proximal contraction mappings in-between subsets of metric spaces because of the close formal relation between cyclic self-mappings and proximal mappings. See, for instance, [40] and references therein.

2 Main results

The first main result follows.

Theorem 2.1 Let ( X , d ) be a complete metric space, and let T : A B A B be, in general, a multivalued cyclic self-mapping, where A , B X are nonempty, closed and subject to the contractive constraint
[ φ ( x , y , K , α , β ) d ( x , T x ) d ( x , y ) ] [ H ( T x , T y ) M ( x , y , K , α , β ) + ω D ]
(2.1)
subject to (1.1)-(1.4), for some ω R + , K [ 0 , 1 ) and ( α , β ) Δ ; ( x , y ) ( A B ) × ( B A ) . Assume also that
K 1 = max ( K , β 1 α , α 1 β ) [ 0 , 1 ) , K 2 = max ( 1 1 α , 1 1 β ) [ 1 , ) .
(2.2)

Then the following properties hold:

(i) There is a sequence { x n } in A B satisfying x i + 1 T x i , i N such that
D d ( x n + 1 , x n ) < ; D lim sup n d ( x n + 1 , x n ) ω K 2 D 1 K 1 .

If A and B are bounded sets which intersect, then n = 1 d ( x n + 1 , x n ) < and { x n } is a Cauchy sequence having its limit in A B , with x n + 1 T x n ; n N for any given x 1 A B .

If A and B are not bounded, then the above property still holds if d ( x 1 , x 2 ) < . Furthermore, lim n d ( x n + 1 , x n ) = D exists if ω = 1 K 1 K 2 for any given x 1 A B with the sequence { x n } being constructed in such a way that x n + 1 T x n .

If x 1 A , then the sequence of sets { T x 2 n + 1 } T ( B ) A converges to a subset { z A } of best proximity points in A (in the sense that any point z 2 n + 1 ( { T x 2 n } ) z 0 { z A } as n ) and the sequence of sets { T x 2 n } T ( A ) B converges to a subset { z B } T { z A } T ( A ) B of best proximity points in B with { z A } T { z B } T ( B ) A .

If D = 0 , i.e., if A B , then lim n sup m > n d ( x m , x n ) = lim n d ( x n + 1 , x n ) = 0 , and any sequence { x n } being iteratively generated as x n + 1 T x n , for any x 1 = x A B , is a Cauchy sequence which converges to a fixed point z T z ( A B ) of T : A B A B .

(ii) Assume that A B , that A and B are convex, and that z i T z i ; i N ¯ = { 1 , 2 , , N } are fixed points of T : A B A B . Then z i = z j A B and T z i T z j A B ; i , j ( i ) N ¯ = { 1 , 2 , , N } , that is, the image sets of any fixed points are identical.

(iii) Consider a uniformly convex Banach space ( X , ) , so that ( X , d ) is a complete metric space for the norm-induced metric d : X × X R 0 + , and let A and B be nonempty, disjoint, convex and closed subsets of X with T : A B A B satisfying the contractive conditions (2.1)-(2.2) with ω = 1 K 1 K 2 .

Then a sequence { x 2 n } built so that x 2 n T x 2 n 1 with x 2 n 1 T x 2 n 2 is a Cauchy sequence in A if x 1 A and a Cauchy sequence in B if x 1 B so that lim n d ( x 2 n + 3 , x 2 n + 1 ) = lim n d ( x 2 n + 2 , x 2 n ) = 0 ; x 1 A B , and lim n d ( x 2 n + 2 , x 2 n + 1 ) = lim n d ( x 2 n + 1 , x 2 n ) = D ; x 1 A B . If x 1 A and x 2 T x 1 T ( A ) B , then the sequences of sets { T 2 n x 1 } { T ( T 2 n 1 x 1 ) } and { T 2 n + 1 x 1 } converge to unique best proximity points z A T z B and z B T z A in A and B, respectively.

Proof The proof is organized by firstly splitting it into two parts, namely, the situations: (a) M 2 defined in (1.2a), or (b) M 1 , defined in (1.2b), gives the maximum for M, defined in (1.1); and then in five distinct cases concerning (1.3), subject to (1.4), as follows.

(a) Assume that M 2 ( x , y , α , β ) < M 1 ( x , y , K ) . Take, with no loss in generality, x A and y T x and note that φ ( x , y , K , α , β ) d ( x , T x ) d ( x , T x ) d ( x , y ) since φ ( x , y , K , α , β ) ( 0 , 1 ] , which implies that φ ( x , y , K , α , β ) d ( x , T x ) d ( x , T x ) , and since y T x , then it follows that d ( x , T x ) d ( x , y ) . Since M 2 ( x , y , α , β ) < M 1 ( x , y , K ) , then one gets from the definition of Hausdorff metric (1.5) and the contractive condition (2.1), which holds for any x , y A B , that for some y T x ,
d ( y , T y ) H ( T x , T y ) M ( x , y , K , α , β ) + ω D = M 1 ( x , y , K ) + ω D = K max { d ( x , y ) , d ( x , T x ) , d ( y , T y ) , 1 2 ( d ( x , T y ) + d ( y , T x ) ) } + ω D = K max { d ( x , y ) , d ( y , T y ) , d ( x , T y ) 2 } + ω D = K max { d ( x , y ) , d ( x , T y ) 2 } + ω D
(2.3)
since K [ 0 , 1 ) , d ( x , T x ) d ( x , y ) and d ( y , T x ) = 0 ; y T x . Also, since β [ 0 , 1 ) and φ ( y , x , K , α , β ) d ( y , T y ) d ( y , T y ) d ( x , y ) , then d ( y , T y ) 1 1 β ( d ( x , y ) + ω D ) . Thus, there is y T x such that d ( y , T y ) 1 1 β ( d ( x , T x ) + ω D ) so that
d ( y , T y ) min ( α 1 β d ( x , T x ) , K max { d ( x , y ) , d ( x , T y ) 2 } ) + ω D 1 β min ( α 1 β d ( x , T x ) , K max { d ( x , y ) , d ( x , y ) + d ( y , T y ) 2 } ) + ω D 1 β min ( α 1 β d ( x , T x ) , K max { d ( x , y ) , d ( y , T y ) 2 } ) + ω D 1 β min ( α 1 β d ( x , T x ) , K d ( x , y ) ) + ω D 1 β max ( K , α 1 β ) d ( x , y ) + ω D 1 β
(2.4)

since d ( x , T x ) d ( x , y ) ; y T x .

(b) Assume that M 2 ( x , y , α , β ) M 1 ( x , y , K ) so that
d ( y , T y ) M 2 ( x , y ) = α d ( x , T x ) + β d ( y , T y ) + ω D .
(2.5)
This implies also that d ( y , T y ) α 1 β d ( x , T x ) + ω D 1 β and again (2.4) holds for y T x . As a result,
d ( y , T y ) max ( K , α 1 β ) d ( x , y ) + ω D 1 β ; x A , y B .
By interchanging the roles of the sets A and B, one also gets by proceeding in a similar way:
d ( x , T x ) max ( K , β 1 α ) d ( x , y ) + ω D 1 α ; x A , y B .
Thus,
d ( x , T x ) max ( K , β 1 α , α 1 β ) d ( x , y ) + max ( 1 1 α , 1 1 β ) ω D = K 1 d ( x , y ) + K 2 ω D ;
(2.6)

( x , y ) ( A B ) × [ T ( A B ) ] , where K 1 = max ( K , β 1 α , α 1 β ) [ 0 , 1 ) and K 2 = max ( 1 1 α , 1 1 β ) . Note that since T : A B A B is cyclic, then y , T x B if x A and conversely.

Now, construct a sequence { x n } in A B as follows: x = x 1 A , x 2 T x 1 T ( A ) B , …, x 2 n T x 2 n 1 T ( A ) B , …, x 2 n + 1 T x 2 n T ( B ) A which satisfies
D d ( x n + 1 , x n ) K 1 d ( x n , x n 1 ) + ω K 2 D K 1 n 1 d ( x 2 , x 1 ) + ( i = 0 n 2 K 1 i ) K 2 ω D ; n N K 1 n 1 d ( x 2 , x 1 ) + 1 K 1 n 1 1 K 1 K 2 ω D < ; n N .
(2.7)
Then D lim sup n d ( x n + 1 , x n ) K 2 ω D 1 K 1 . On the other hand,
n = 1 j d ( x n + 1 , x n ) n = 1 j ( K 1 n 1 d ( x 2 , x 1 ) + 1 K 1 n 1 1 K 1 K 2 ω D ) 1 1 K 1 [ ( 1 K 1 j ) d ( x 2 , x 1 ) + ( n = 1 j ( 1 K 1 n 1 ) ) K 2 ω D ] ; n N
(2.8)
so that
n = 1 d ( x n + 1 , x n ) 1 1 K 1 [ d ( x 2 , x 1 ) + ( n = 1 ( 1 K 1 n 1 ) ) K 2 ω D ] ; n N ,
(2.9)
and we conclude that { x n } is a Cauchy sequence if D = 0 (i.e., if A and B intersect provided that they are bounded or simply if d ( x 2 , x 1 ) < ) since lim n sup m > n d ( x m , x n ) = lim n d ( x n + 1 , x n ) = 0 , which has a limit z in X, since ( X , d ) is complete, which is also in A B which is nonempty and closed since A and B are both nonempty and closed since T ( A ) B and T ( B ) A . On the other hand, for any distance D 0 between A and B,
D d ( x 2 n + 3 , x 2 n + 2 ) K 1 2 n + 1 d ( x 2 , x 1 ) + ( i = 0 2 n K 1 i ) ω D D K 1 2 n + 1 d ( x 2 , x 1 ) + 1 K 1 2 n + 1 1 K 1 K 2 ω D ; n N ,
(2.10)
D d ( x 2 n + 2 , x 2 n + 1 ) K 1 2 n d ( x 2 , x 1 ) + ( i = 0 2 n 1 K 1 i ) ω D D K 1 2 n d ( x 2 , x 1 ) + 1 K 1 2 n 1 K 1 K 2 ω D ; n N ,
(2.11)
0 d ( x 2 n + 3 , x 2 n + 1 ) K 1 d ( x 2 n + 2 , x 2 n ) + ω D K 1 2 d ( x 2 n + 1 , x 2 n 1 ) + ( 1 + K 1 ) K 2 ω D 0 K 1 3 d ( x 2 n , x 2 n 2 ) + ( 1 + K 1 + K 1 2 ) ω D K 1 4 d ( x 2 n 1 , x 2 n 3 ) + ( 1 + K 1 + K 1 2 + K 1 3 ) K 2 ω D 0 K 1 2 n d ( x 3 , x 1 ) + ( i = 0 2 n 1 K 1 i ) ω D K 1 2 n d ( x 3 , x 1 ) + 1 K 1 2 n 1 K 1 K 2 ω D ; n N .
(2.12)
Note that the sequences { d ( x n , x n + 1 ) } and { d ( x n , x n + 2 ) } are bounded if x 1 and x 2 T x 1 are such that d ( x 1 , x 2 ) < , which is always guaranteed if A and B are bounded. If ω = 1 K 1 K 2 , then one gets from the above relations that
lim n d ( x 2 n + 3 , x 2 n + 2 ) = lim n d ( x 2 n + 2 , x 2 n + 1 ) = D ,

where x 2 n + 1 T x 2 n A , x 2 n + 2 T x 2 n + 1 B and x 2 n + 3 T x 2 n + 2 A . Thus, any sequences of sets { x 2 n + 1 } and { x 2 n } contain the best proximity points of A and B, respectively, if x 1 A and, conversely, of B and A if x 1 B and converge to them. This follows by contradiction since, if not, for each k N , there is some ε = ε ( k ) R + , some subsequence { n k j } j N of natural numbers with n k m > n k j > k for m > j , and some related subsequences of real numbers { x 2 n k j + 1 } and { x 2 n k j } such that d ( x 2 n k j + 2 , x 2 n k j + 1 ) D + ε so that d ( x 2 n k + 2 , x 2 n k + 1 ) D as n k is impossible.

Now, assume D = 0 and consider separately the various cases in (1.3)-(1.4), by using the contractive condition (2.1), subject to (1.1)-(1.4), to prove that there is z T z in A B to which all sequences converge by using D = 0 lim n sup m > n d ( x m , x n ) = lim n d ( x n + 1 , x n ) = 0 { x n } z A B with { x n } being a Cauchy sequence since ( X , d ) is complete and A and B are nonempty and closed.

Case 1: φ ( x , y , K , α , β ) = 1 , ( [ ( α , β ) Δ 1 ] [ ( α , β ) Δ 2 ] ) ( M ( z , z , K , α , β ) = M 2 ( z , z , α , β ) > M 1 ( z , z , K ) ) .

Then d ( z , T z ) = φ ( z , z , K , α , β ) d ( z , T z ) ( α + β ) d ( z , T z ) ( 1 α 2 ) d ( z , T z ) if ( α , β ) Δ 1 . Thus, the contradiction d ( z , T z ) < d ( z , T z ) holds if ( α , β ) Δ 1 , α 0 and z T z . Hence, z T z if ( α , β ) Δ 1 with α 0 since Tz is closed. If α = 0 , then 0 β < 1 so that d ( z , T z ) β d ( z , T z ) < d ( z , T z ) if z T z . Hence, z T z if α = 0 and ( 0 , β ) Δ 1 . The proof that z T z if ( α , β ) Δ 2 is similar since ( α , β ) Δ 2 ( β , α ) Δ 1 from the definitions of the sets Δ 1 and Δ 2 , and the fact that distances have the symmetry property.

Case 2: φ ( z , z , K , α , β ) = 1 β , ( [ ( α , β ) Δ 3 ] ) ( M ( z , z , K , α , β ) = M 2 ( z , z , α , β ) > M 1 ( z , z , K ) ) .

Then the contractive condition becomes ( 1 β ) d ( z , T z ) = φ ( x , y , K , α , β ) d ( z , T z ) ( α + β ) d ( z , T z ) . Then either z T z or z T z and 1 < α + 2 β with ( α , β ) Δ 3 . But the second possibility is impossible since Δ 3 = { ( α , β ) Δ : α ( 0 , 1 / 2 ) , 1 α 2 β } so that 1 α + 2 β . Hence, z T z since Tz is closed.

Case 3: φ ( z , z , K , α , β ) = 1 β 1 β + α , ( ( α , β ) Δ 4 ) ( M ( z , z , K , α , β ) = M 2 ( z , z , α , β ) > M 1 ( z , z , K ) ) .

Then 1 β 1 β + α d ( z , T z ) = φ ( z , z , K , α , β ) d ( z , T z ) ( α + β ) d ( z , T z ) if ( α , β ) Δ 4 , which implies for z T z if ( α , β ) Δ 4 that 1 β 1 β + α > α + β , equivalently, 1 > α ( 1 + α ) + β ( 2 β ) . Since Δ 4 = { ( α , β ) Δ : α ( 1 + α ) + β ( 2 β ) 1 } , z T z with ( α , β ) Δ 4 is impossible. Hence, z T z since Tz is closed.

Case 4: φ ( x , y , K , α , β ) = 1 , ( 0 K < 1 / 2 ) ( M 2 ( z , z , α , β ) M ( z , z , K , α , β ) = M 1 ( z , z , K ) ) .

Then d ( z , T z ) = φ ( z , z , K , α , β ) d ( z , T z ) K max { d ( z , z ) , d ( z , T z ) , d ( z , T z ) 2 } = K d ( z , T z ) < d ( z , T z ) , which is a contradiction for any z T z . Hence, z T z since Tz is closed.

Case 5: φ ( x , y , K , α , β ) = 1 K , ( 1 / 2 K < 1 ) ( M 2 ( z , z , α , β ) M ( z , z , K , α , β ) = M 1 ( z , z , K ) ) .

Then
( 1 K ) d ( z , T z ) = φ ( z , z , K , α , β ) d ( z , T z ) d ( z , T z ) d ( z , T z ) K max { d ( z , z ) , d ( z , T z ) , d ( z , T z ) 2 } = K d ( z , T z ) < d ( z , T z ) ,
which is a contradiction if z T z . Hence, z T z since Tz is closed. A combined result of Cases 1-5 is that D = 0 { x n } z T z ( A B ) for any x 1 A B . Now, assume again that A B and that there are two distinct fixed points z x ( z y T z y ) T z x necessary located in A B to which the sequences { x n } and { y n } converge to z A B and q ( z ) A B , respectively, where x n + 1 T x n , y n + 1 T y n for n N , where x 1 , y 1 ( x 1 ) A B . Assume also that T z T q . One gets from the contractive condition (2.1), subject to (1.1)-(1.4), that
max ( d ( z , T q ) , d ( q , T z ) ) max ( sup x T z d ( x , T q ) , sup y T q d ( y , T z ) ) K max ( d ( z , q ) , 1 / 2 ( d ( z , T q ) + d ( q , T z ) ) ) = K d ( z , q ) < d ( z , q ) .

Thus, construct sequences z n + 1 T z n , q n + 1 T q n with z 1 = z and q 1 = q such that d ( z , q n + 1 ) < d ( z , q n ) and d ( q , z n + 1 ) < d ( q , z n ) for n N . Since z , q A B which is nonempty, closed and convex, for any given ε R + , there is n 0 = n 0 ( ε ) such that x n and q n are in A B for n n 0 . Then q n z ˆ ( T z ) and z n q ˆ ( T q ) as n with z T z A B and q T q A B . Hence, T z T q in A B contradicting the hypothesis that such sets are distinct. Properties (i)-(ii) have been proven.

Property (iii) is proven by using, in addition, [[35], Lemma 3.8], one gets
lim n d ( x 2 n + 3 , x 2 n + 2 ) = lim n d ( x 2 n + 2 , x 2 n + 1 ) = D lim n d ( x 2 n + 3 , x 2 n + 1 ) = 0
for any sequence { x n } with x 1 A B and x n + 1 T x n since ( X , d ) is a uniformly convex Banach space, A and B are nonempty and disjoint closed subsets of X and A is convex. Note that Lemma 3.8 of [35] and its given proof remain fully valid for multivalued cyclic self-maps since only metric properties were used in its proof. It turns out that { x 2 n + 1 } is a Cauchy sequence, then bounded, with a limit z A in A, which is also a best proximity point of T : A B A B in A since
lim n d ( x 2 n + 2 , x 2 n + 1 ) = lim n d ( x 2 n + 2 , z A ) = D lim n d ( x 2 n + 2 , x 2 n ) + lim n d ( x 2 n , z A ) = lim n d ( x 2 n , z A ) D

and then { x 2 n } converges to some point z B T z A B , which is also a best proximity point in B (then z B T z A and T z A B ), since ( X , d ) is a uniformly convex Banach space and A and B are nonempty closed and convex subsets of X. In the same way, z A T z B A . Also, { x 2 n } and { x 2 n + 1 } are bounded sequences since { x 2 n } is bounded and D < . Also, if x 1 B and B is convex, then the above result holds with x 2 n + 1 T x 2 n B , x 2 n + 2 T x 2 n + 1 A and x 2 n + 3 T x 2 n + 2 B . Now, for D > 0 , the reformulated five cases in the proof of Property (i) would lead to contradictions D = d ( z A , z B ) < D 0 if z A T z B or if z B T z A . From Proposition 3.2 of [35], there are z A T z B and z B T z A such that D = d ( z A , T z A ) = d ( z B , T z B ) since T : A B A B is cyclic satisfying the contractive conditions (2.1)-(2.2), where A and B are nonempty and closed subsets of a complete metric space ( X , d ) , with convergent subsequences { x 2 n + 1 } and { x 2 n } in both A and B, respectively, for any x = x 1 A and in B and A, respectively, for any given x = y 1 B . Assume that some given sequence { x 2 n + 1 } in A is generated from some given x 1 A with x 2 n + 1 T x 2 n , which converges to the best proximity point z A A T z B in A of T : A B A B . Assume also that there is some sequence { y 2 n } , distinct from { x 2 n } , in A generated from y 1 ( x 1 ) A with y 2 n + 1 T y 2 n which converges to z A 1 A , where z B B T z A is a best proximity point in B of T : A B A B . Consider the complete metric space ( X , d ) obtained by using the norm-induced metric in the Banach space ( X , ) so that both spaces can be mutually identified to each other. Since d ( x , y ) D for any x A and y B , it follows that D = d ( z B , z A ) = d ( z A , T z A ) = d ( z B , T z B ) < d ( z A 1 , T z A ) if z A 1 A T z B ¯ , where z A and z B are best proximity points of T : A B A B in A and B and T z B ¯ is the closure of T z B . Hence, z A , z A 1 T z B and z B T z A and then any sequence converges to best proximity points.

It is now proven by contradiction that the best proximity points in A and B are unique. Assume that x , y A are two distinct best proximity points of T : A B A B in A. Then there are z x ( T x B ) B , z x ( T y B ) B , z x ( T z x A ) ( T 2 x A ) A and z y ( T z y A ) ( T 2 y A ) A so that, one gets
D = x z x = z x z x = y z y = z y z y ,

which leads to the contradiction D > y z x = z x z x = D , and then x = y = z A A . Hence Property (iii) has been proven. □

A special case of Theorem 2.1 is stated and proven in the subsequent result.

Corollary 2.2 Assume that ( X , ) is a uniform Banach space with associate norm-induced metric d : X × X R 0 + , and let A and B be nonempty closed and convex subsets of X. Assume also that K = 0 , K 1 = max ( β 1 α , α 1 β ) [ 0 , 1 ) , K 2 = max ( 1 1 α , 1 1 β ) [ 1 , ) and ω = 1 K 1 K 2 in the contractive condition (2.1). If max ( α , β ) < 1 / 2 , then there are z 1 A and z 2 B such that z 1 ( T 2 z 1 T z 2 ) , z 2 ( T 2 z 2 T z 1 ) , i.e., z 1 and z 2 are, respectively, best proximity points of T : A B A B in A and B, respectively, and simultaneously, fixed points of T 2 : A B A B , respectively. In addition, if A B , then z T z is a fixed point of T : A B A B . The result also holds if max ( α , β ) < 1 (and, in particular, if min ( α , β ) = 0 ).

Proof Assume, with no loss in generality, that 0 β α [ 0 , 1 / 2 ) . Take u 1 A and u 2 T u 1 by noting that u 2 T u 1 T ( A ) B since T : A B A B a multivalued cyclic self-mapping. □

Remark 2.3 Note that the particular case M ( T x , T y , K , α , β ) = M 2 ( T x , T y , α , β ) in the contractive condition (2.1) is useful to investigate multivalued cyclic Kannan self-mappings which are contractive with α = β [ 0 , 1 / 2 ) and some of their generalizations [33, 34].

The following result follows directly from Theorem 2.1 and Corollary 2.2 without proof.

Corollary 2.4 Assume that T : A B A B is a single-valued cyclic self-mapping where A and B are nonempty closed subsets of X where ( X , d ) is a complete metric space. Then Theorem  2.1 and Corollary  2.2 still hold mutatis-mutandis for a fixed point z = T z A B if A and B are convex and intersect and best proximity points are z A A , z B B with z A = T z B = T 2 z A , if, in addition ( X , ) is a uniformly convex Banach space.

Remark 2.5 The results of this section can be extended mutatis-mutandis to multivalued s ( 2 ) -cyclic self-maps T : i s ¯ A i i s ¯ A i , where s ¯ = { 1 , 2 , , s } , A i ( ) X , T ( A i ) A i + 1 and A s + 1 A 1 with ( X , d ) being a complete metric space. See [2, 3, 36, 37] and references therein for some background results for single-valued cyclic s-self-mappings.

3 Example of application to time-varying discrete-time dynamic systems

3.1 Multi-control discrete-time linear dynamic system

The problems of stability in differential equations, difference equations and related dynamic systems are closely related to fixed point theory of single-valued functions since stable equilibrium points are fixed points [4144]. Also, fixed point theory of a class of cyclic self-mappings has been recently applied to differential and difference impulsive equations in a stability context study [44]. On the other hand, some typical applications of multivalued maps can be located in the framework of dynamic programming techniques for optimal control of dynamic systems [26, 45]. Several tentative controls are tested to obtain the one which minimizes a suitable cost function on a certain ahead time-interval. One of them is selected as the optimal one. Đorić and Lazović discussed in [1] a dynamic programming application in the continuous-time domain of contractive multivalued-self maps under the theoretical results of their paper. Switches among distinct parameterizations of a dynamic system and the associate stabilization problem have been discussed in the literature. Also, switching processes among different estimators of unknown systems according to the optimization or suboptimization of some appropriate loss function have been described so as to improve the estimation error. See, for instance, [4143] and included references. On the other hand, fixed point theory has been shown to be useful to discuss the stability of iterative sequences and, in general, for the analysis of the stability of discrete dynamic systems. See, for instance, [46] and references therein. We now discuss a linear time-varying discrete control problem under several tentative controls at each stage with the purpose of selecting the control sequence which guarantees a prescribed stability degree of the feedback system. The problem is stated in such a way that the tentative state-trajectory solution is formally stated as a multivalued function generating several point-to-point iterated sequences and one of them is being selected. In particular, each current state generates a set of tentative ones at the next sampling time which belongs to the image set of the current sampled state. The convergence to fixed points or to best proximity points, if the trajectory solution sequence has a cyclic nature, describes the convergence either to equilibrium points or to a limit cycle of the solution. This second case occurs when the mapping defining the state-trajectory solution is cyclic and the subsets on whose union such a mapping is defined do not intersect. Consider the discrete time-varying control system:
x n + 1 = A n x n + B n u n ; n N 0 = N { 0 } ,
(3.1)
where x n R p is the state vector sequence for any n N 0 = N { 0 } under some nonzero initial state x 0 R p and u n = K n x n R q for some 1 q p and all n N 0 is the linear time-varying control where K n S K n = { K n 1 , K n 2 , , K n J n } ; n N 0 is a sequence of control gain matrices in R p × q which is chosen from an admissible set S K n of cardinal J n J < values for each n N 0 . System (3.1) is said to be an uncontrolled (or open-loop) system if the control sequence is identically zero [26]. The controlled (or closed-loop) system for any time-varying control being generated by a state-feedback control law under a gain matrix sequence K n S K n results to be
x n + 1 = M n x n = A n x n + B n u n = ( A n + B n K n ) x n ; n N 0 ,
(3.2)
where { M n } is a sequence of matrices in R p × q of closed-loop dynamics. The stabilization via linear state-feedback of (3.2) and its links to fixed point theory via Theorem 2.1 are now discussed. For any sequence of natural numbers j n N with n N 0 , the following relation is obtained from (3.2):
x n + j n ( i = n n + j n 1 [ A i ] ) x 0 = C ( n , j n ) u ( n , j n ) ; n N 0 ,
(3.3)
where
C ( n , j n ) = [ B n + j n 1 , A n + j n 1 B n + j n 2 , , ( i = j n + 1 n + j n 1 [ A i ] ) B j n ] ; n N 0 ,
(3.4)
u ( n , j n ) = [ u n + j n 1 , u n + j n 2 , , u j n ] T ; n N 0 ,
(3.5)
where the superscript ‘T’ denotes matrix transposition. Note that if j n = p for n N 0 , then C ( n , p ) is the p × q p controllability matrix of (3.1) on the sequence of samples { j } n n + p 1 . Any prefixed state is reachable in any given prefixed number of samples from a null initial condition by some linear time-invariant state-feedback control in at most p samples if and only if (3.1) is reachable, that is, if
rank C ( n , j n ) = rank ( i = j n n + j n 1 ( k = i + 1 n + j n 1 [ A k ] ) B i B i T ( k = i + 1 n + j n 1 [ A k ] ) T ) = p
(3.6)

for any sequence of integers { j n } with j n p , n N 0 with j 0 = 0 such that { j n + 1 j n } is uniformly bounded. It is controllable to the origin if and only if it is reachable, that is, (3.6) holds and, furthermore, A n are all non-singular for n N 0 . It is well known that if the dynamic system (3.1) is controllable to the origin, then it is also stabilizable in the sense that some linear time-varying state-feedback control sequence { u k } is such that x n 0 as n for any x 0 R n . The controllability assumption can be weakened while keeping the stabilizability property as follows.

Proposition 3.1 Assume that (3.1) is stabilizable (which is guaranteed if it is controllable to the origin).

Then the following properties hold:

(i) There is a sequence of control gain matrices { K n } such that all the matrices in the subsequence { i = 0 j n 1 [ A j n + i + B j n + i K j n + i ] } are convergent matrices with j n N with j 0 = 0 being some existing sequence with { j n + 1 j n } being a uniformly bounded sequence for any n N 0 .

(ii) The subsequence { x i = 0 n j i } of states of the closed-loop system (3.2) converges to zero as n . As a result, the sequence { x n } of states of the closed-loop system also converges to zero as n .

Proof One gets from (3.2) that if such a sequence { j n } of finite natural numbers exists for n N 0 with j 0 = 0 , then
x j n + j n + 1 = ( i = 0 j n + 1 1 [ A j n + i + B j n + i K j n + i ] ) x j n = k = 0 n { ( i = 0 j k + 1 1 [ A j k + i + B j k + i K j k + i ] ) } x 0 0
(3.7)
as n for some existing sequence of stabilizing controller gains { K n } since ( i = 0 j n + 1 1 [ A j n + i + B j n + i K j n + i ] ) , and then k = 0 n { ( i = 0 j k + 1 1 [ A j k + i + B j k + i K j k + i ] ) } are all convergent matrices, i.e., with all their eigenvalues being of modulus less than one. Note that, since system (3.1) is stabilizable, then such a sequence of nonnegative integers { j n } always exists since it exists with j n = 1 for all n N 0 . Now, it follows from (3.7) for any vector-induced matrix norm that
x j = ( k = i = 0 n j i j 1 [ A k + B k K k ] ) x i = 0 n j i ( k = i = 0 n j i j 1 [ A k + B k K k ] ) ( k = 0 n { ( i = 0 j k + 1 1 [ A j k + i + B j k + i K j k + i ] ) } ) x 0 0
(3.8)
as n for any integer j ( i = 0 n j i , i = 0 n + 1 j i ) since ( k = 0 n { ( i = 0 j k + 1 1 [ A j k + i + B j k + i K j k + i ] ) } ) x 0 0 as n , and
( k = i = 0 n j i j 1 [ A k + B k K k ] ) ( k = i = 0 n j i j n + 1 1 [ A k + B k K k ] ) Q <
(3.9)

since the sequence { j n + 1 j n } is uniformly bounded. Thus, { x n } converges to zero for any given x 0 R n . □

Proposition 3.1 is linked to Theorem 2.1 of Section 2 in the subsequent result.

Theorem 3.2 The following properties hold:

(i) Assume that system (3.1) is stabilizable and a linear time-varying feedback control u n = K n x n R q is used where K n S K n = { K n 1 , K n 2 , , K n J n } for any n N 0 . Assume also that for each j [ k = 0 n j k , k = 0 n + 1 j k ) for some sequence of nonnegative integers { j n } , such that { j n + 1 j n } is uniformly bounded, for any n N 0 with j 0 = 0 , there is a controller gain K j k S K J n = { K k = 0 n j k 1 , K k = 0 n j k 2 , , K k = 0 n j k J j n } for some integer k [ 1 , J j n ] with J n J < for all n N 0 such that any matrix in the subsequence of matrices { i = 0 j n + 1 1 [ A k = 0 n j k + i + B k = 0 n j k + i K k = 0 n j k + i k ] } is convergent for each k [ 1 , J j n ] for some uniformly bounded sequence of samples { j n + 1 j n } and some set of upper-bounded positive integer numbers J n for all n N 0 .

(ii) If, in addition, the elements of the subsequence of pairs { ( A j n , B j n ) } are all controllable for some sequence of nonnegative integers { j n } , with the sequence of natural numbers { j n + 1 j n } being uniformly bounded, then the closed-loop system can be exponentially stabilized via time-varying linear control with prescribed stability degree.

Outline of proof Property (i) follows directly from Proposition 3.1. Property (ii) follows since all the pairs ( A j n , B j n ) being controllable implies that the matrices of the closed-loop dynamics satisfy at the subsequence { j n } of samples the following matrix relation:
M j n = A j n + B j n K j n = A j n + i = 1 q B j n ( i ) K j n ( i ) T [ 0 I p 1 g j n T ] ,
(3.10)

where the superscript ‘ ( i ) ’ stands for the i th row vector of matrix, ‘≈’ stands for matrix similarity, I p 1 denotes the ( p 1 ) identity matrix and g j n T denotes some prefixed p-real row vector by the appropriate choice of the real controller matrix K j n , since ( A j n , B j n ) is controllable, towards the achievement of a suitable closed-loop stability degree. Note that the closed-loop matrix of dynamics at the j n -sample is similar by a similarity transformation to its companion block partitioned form in (3.10). Thus, both matrices have the same characteristic monic polynomial, thus the same characteristic roots which are also the prefixed eigenvalues of the closed-loop dynamics given by (3.10), which can be arbitrarily fixed via K j n such that its non-leading real coefficients are the components of the real row vector g j n T . Thus, the sequence of closed-loop matrices can be chosen with the sequence M j n having a stability degree ρ j n ( 0 , 1 ) such that the stability degree of ( i = 0 j n + 1 1 [ M j n + i ] ) M j n ρ ( 0 , 1 ) . This follows since i = 0 j n + 1 1 [ M j n + i ] P < since { j n + 1 j n } is uniformly bounded. Thus, the time-varying closed-loop system is exponentially stable with prescribed stability degree ρ and x j P ρ n x 0 for any integer j [ j n , j n + 1 ) and n N 0 . □

The stability degree is defined by the modulus of the dominant eigenvalue of the matrix of dynamics if the dominant eigenvalue is simple and such a number is a strict upper-bound of the stability degree, otherwise. At samples which are not in the subsequence { j n } , the controller gains may be chosen arbitrarily. The exponential stabilization of the closed-loop system is now related to Theorem 2.1 as follows. Assume that the sequence { S K j n } of sets of matrices S K j n = { K j n 1 , K j n 2 , , K j n J j n } contains at least a stabilizing matrix such that Theorem 3.2(ii) holds via stabilization with such stabilizing matrices.

Then Theorem 2.1 is applicable to some subset A = B X R p being a nonempty bounded set about 0 R p such that the initial condition of (3.1) satisfies x 0 A 0 A of with D = 0 since A = B . Take the distance function equal to the Euclidean norm so that we can consider the complete metric space ( X , d ) to be identical to the Banach space ( X , ) . Re-denote the sequence of points in A as the states x j 0 x 0 ( A 0 ) x 1 A (the replacement is made following the notation of Theorem 2.1), x j 1 x j 1 ( A ) x 2 A , x j 2 x j 2 ( A ) x 3 A ,  . If Theorem 3.2(ii) holds, then there is some bounded A A 0 such that T : A A defined by ( T x n = x n + 1 ) ( ( i = 0 j n + 1 1 [ M j n + i ] ) M j n x j n = x j n + 1 ) for n N is a contractive mapping which defines the state trajectory solution at the points of the sampling subsequence { j n } . Take K 1 = K = ρ < 1 and α = β = 0 in Theorem 2.1. Note that if the stabilizing matrix is chosen within the sequence of matrices, then T : A A is single-valued. If all the matrices in the sequence K J n = { K k = 0 n j k 1 , K k = 0 n j k 2 , , K k = 0 n j k J j n } are tested, then the multivalued map T : A A is defined as T x n = { x n + 1 1 , , x n + 1 J n } such that x n , x n + 1 T x n satisfies the Hausdorff particular contractive condition of Theorem 2.1. Also, one of the points of the sequence of sets { T x n } satisfies the point-to-point contractive particular condition of Theorem 2.1, by virtue of such a theorem, according to the constraints
( T j n + 1 I ) x j n + 1 ( T j n + 1 I ) x j n + 1 K 1 ( T j n I ) x j n K 1 n ( T j n I ) x 0
(3.11)

obtained from the stabilizing control matrix sequence, and, furthermore, x j n + j P K 1 x j n for all samples given by the integers j [ 1 , j n + 1 ) . Note that the 2 -matrix norm of any real matrix M of any order satisfies λ min 1 / 2 ( M T M ) M 2 = λ max 1 / 2 ( M T M ) , where λ max ( ) and λ min ( ) stand, respectively, for the maximum and minimum eigenvalues of the ( ) -matrix with all its eigenvalues being real. A weak result is obtained with the particular case K = β = 0 and K 1 = α 1 α = ρ 1 ρ < 1 for 0 < ρ < 1 / 2 in the contractive condition of Theorem 2.1. In this case, we have a multivalued contractive Kannan self-mapping. In both cases, 0 R p is a fixed point of T : A A for any A X which is also a stable equilibrium point of the closed-loop dynamic system. Now assume p = q = 1 , that is, the uncontrolled system (3.1) is scalar subject to a scalar control with A = { z ε : z R } R 0 + and B = A for some given ε R 0 + . Take x 0 A B , then | x 0 | ε , and note that D = dist ( A , B ) = 2 ε . The tentative controller gains used are K n i = δ n i sgn x n if x n 0 and K n i = 0 if x n = 0 for the bounded sets of integers i [ 1 , J n ] for n N 0 , where the nonnegative real sequences of sets { δ n i : 1 i J n } are uniformly bounded and contain a strictly decreasing positive real sequence { δ j n i n } with i n [ 1 , J j n ] and some existing difference sequence of integers { j n + 1 j n } being uniformly upper-bounded for n N 0 .

The formalism of Section 2 is applicable to bounded sets A 0 A and B 0 B with max ( diam A 0 , diam B 0 ) = | | x 0 | ε | . If ε = 0 , then a particular case of the above result follows for p = 1 . If ε > 0 , then the closed-loop state-trajectory solutions { x 2 n + 1 } and { x 2 n + 1 } converge to the best proximity points ε and −ε, respectively, if the initial condition is in A and, conversely, if it is in B under the sequence of stabilizing matrices { δ j n i n } .

3.2 Numerical example: a vector-valued discrete-time dynamic system with multiple parameterizations

A numerical simulation of the above-presented example (3.1) is given now. Consider the discrete-time dynamic switched system described by
x n + 1 = T x n = A σ ( n ) x n + B σ ( n ) u n
(3.12)
with
A 1 = [ 1 0.1 4.019 0.1667 ] , A 2 = [ 1 0.1 2.4504 0.4369 ] , A 3 = [ 1 0.1 1.5256 0.6069 ] , B 1 = 10 3 [ 0 0.1667 ] T , B 2 = 10 3 [ 0 0.1126 ] T , B 3 = 10 4 [ 0 0.7862 ] T
and σ : N 0 { 1 , 2 , 3 } being the so-called switching function, which selects one of the dynamic systems subscripted by 1, 2 or 3 which parameterize the time-varying system (3.12) at each discrete-time instant (or sample), n. This dynamic system is a simplified version of an automobile roll dynamics enhancement control system given in [15]. The switching function is assumed, for simulation purposes, to be the 1-sample periodic (cyclic) sequence 1 2 3 1 2  . The following state-feedback gains are considered:
K n ( 1 ) = 10 3 [ 2.514 2.8 ] T , K n ( 2 ) = 10 4 [ 1 0.2 ] T , K n ( 3 ) = 10 4 [ 1.3 0.8 ] T .
(3.13)
The control design problem can be formulated as how to select the appropriate feedback gain at each sample, K n , from the set { K n ( 1 ) , K n ( 2 ) , K n ( 3 ) } in order to guarantee the asymptotic stability of the closed-loop. For this purpose, a dynamic optimization procedure can be used. Therefore, n, one considers the multivalued map x n + 1 = T x n = A σ ( n ) x n + B σ ( n ) K n ( i ) x n = ( A σ ( n ) + B σ ( n ) K n ( i ) ) x n for i = 1 , 2 , 3 for each sample n N 0 from R 2 to R 2 . The Banach space ( R 2 , ) can be identified with the metric space ( R 2 , d ) by taking the distance d : X × X R 0 + to be the Euclidean norm. Thus, d ( x n , 0 ) = x n and d ( x n , x n + 1 ) x = x n + 1 x n so that it is direct to apply the formalism and results of Section 2. The multivalued composite map represents the set of reachable states starting from x n for all potential feedback gains { K n ( 1 ) , K n ( 2 ) , K n ( 3 ) } at each sample. Figure 2 displays graphically this concept. The starting point is depicted with a circle. The application of the multivalued map T to this point produces the three points (each one corresponding to one of the feedback matrices { K n ( 1 ) , K n ( 2 ) , K n ( 3 ) } ), labeled as first iteration in Figure 2. A second application of T generates three more points from each previous one, providing nine new points, which are depicted in Figure 2 as the second iteration. This procedure can be continued to generate the complete set of reachable states from x n . The ‘plus’ symbols are used to represent the image for K n ( 1 ) , dots are used for K n ( 2 ) , while squares are used to represent the image for K n ( 3 ) .
Figure 2

Graphical representation of two iterations of the multivalued map T .

The control algorithm generates all the images of the multivalued map T and then chooses the gain K n in such a way that the null vector, z = 0 , is a fixed point of the multivalued map T. In this example, the choice K n = K n ( 1 ) for all n 0 allows stabilizing asymptotically the system. Then, according to Proposition 3.1, all the states are bounded and the norm of the state converges to zero asymptotically as Figures 3 and 4 show.
Figure 3

Evolution of the states with initial condition x 0 T = [ 3 6 ] and K n = K n ( 1 ) .

Figure 4

Evolution of the norm of the state, x n .

In addition, it can be verified that the following matrices are convergent as Proposition 3.1(i) states:
eig ( k = 1 2 [ A σ ( k ) + B σ ( k ) K 1 ] ) = { 0.3242 , 0.0626 } , eig ( k = 1 3 [ A σ ( k ) + B σ ( k ) K 1 ] ) = { 0.0943 ± 0.0407 j } , eig ( k = 1 4 [ A σ ( k ) + B σ ( k ) K 1 ] ) = { 0.0825 , 0.0077 }

while the eigenvalues of the matrix product k = 1 N [ A σ ( k ) + B σ ( k ) K 1 ] , which describes the evolution of the discrete dynamics, converge asymptotically to zero as N .

3.3 Numerical example: a scalar discrete-time dynamic system with multiple parameterization

Now consider the controlled single-input single-output (SISO) dynamic system of the control sequence { u n } n N 0 given by
x n + 1 = T x n = x n + u n
(3.14)
with the state-feedback control law u n = K n x n , where K n { K n ( 1 ) , K n ( 2 ) , K n ( 3 ) } = { 1.5 , 1 , 2 } . This system defines the multivalued map
x n + 1 = T x n = ( 1 + K n ) x n = { x n + 1 ( 1 ) = ( 1 + K n ( 1 ) ) x n , x n + 1 ( 2 ) = ( 1 + K n ( 2 ) ) x n , x n + 1 ( 3 ) = ( 1 + K n ( 3 ) ) x n .
(3.15)
Note that (3.14) is a 2-cyclic self-mapping with non-disjoint semi-closed sets A i ( i = 1 , 2 ) of A 1 = A 2 = R 0 + = R + { 0 } of X = R whose intersection is { 0 } . Consider the complete metric space ( X , d ) which is also a Banach space ( X , ) if the defined distance is the Euclidean norm. Thus, from each value of x n , (3.12) generates an image set of dimension 3, the points being labeled as x n + 1 ( 1 ) , x n + 1 ( 2 ) and x n + 1 ( 3 ) . If the iteration process goes on, then each one of these values generates three more ones as depicted in Figure 5.
Figure 5

Several iterations of the multivalued map ( 3.14 ).

The multivalued map generates three images at k = 1 from the starting value at k = 0 , x 0 = 2 . Then at k = 2 three more values are obtained from each previous one. However, note that only four different values are obtained at k = 2 and five at k = 3 . Thus, the image of T H x n possesses repeated values. Moreover, note that as the number of iterations increases, there are a larger number of points approaching zero since the use of the stabilizing gain K n ( 1 ) forces some of the previously obtained points to approach zero. The particular numerical values for the first iterations showed in Figure 5 are as follows:
x 0 = 2 , x 1 ( 1 ) = 1 , x 1 ( 2 ) = 0 , x 1 ( 3 ) = 2 , x 2 ( 1 , 1 ) = 0.5 , x 2 ( 1 , 2 ) = 0 , x 2 ( 1 , 3 ) = 1 , x 2 ( 2 , 1 ) = 0 , x 2 ( 2 , 2 ) = 0 , x 2 ( 2 , 3 ) = 0 , x 2 ( 3 , 1 ) = 1 , x 2 ( 3 , 2 ) = 0 , x 2 ( 3 , 3 ) = 2 , x 3 ( 1 , 1 , 2 ) = x 3 ( 1 , 3 , 2 ) = x 3 ( 3 , 1 , 2 ) = x 3 ( 1 , 2 , 1 ) = x 3 ( 1 , 2 , 2 ) = x 3 ( 1 , 2 , 3 ) = x 3 ( 2 , 1 , 1 ) = x 3 ( 2 , 1 , 2 ) = x 3 ( 2 , 1 , 3 ) = x 3 ( 3 , 3 , 2 ) x 3 ( 1 , 1 , 2 ) = x 3 ( 2 , 2 , 1 ) = x 3 ( 2 , 2 , 2 ) = x 3 ( 2 , 2 , 3 ) = x 3 ( 2 , 3 , 1 ) = x 3 ( 2 , 3 , 2 ) = x 3 ( 2 , 3 , 3 ) = x 3 ( 3 , 2 , 1 ) = x 3 ( 3 , 2 , 2 ) = x 3 ( 3 , 2 , 3 ) = 0 , x 3 ( 1 , 1 , 1 ) = 0.25 , x 3 ( 1 , 1 , 3 ) = x 3 ( 1 , 3 , 1 ) = x 3 ( 3 , 1 , 1 ) = 0.5 , x 3 ( 3 , 1 , 3 ) = x 3 ( 1 , 3 , 3 ) = x 3 ( 3 , 3 , 1 ) = 1 , x 3 ( 3 , 3 , 3 ) = 2 ,
where the subscript denotes the sample while the superscript denotes the sequence of gains used to reach the point from k = 0 . System (3.11) is asymptotically stabilizable provided that at least one of the following conditions for the sequence of feedback gains { K n } n = 0 is met:
  1. (i)

    { K n } n = 0 contains K n ( 2 ) at least once,

     
  2. (ii)

    { K n } n = 0 contains K n ( 1 ) an infinite (countable) number of times.

     
For instance, the sequence K n = K n ( 1 ) for all n 0 satisfies the above condition (ii) and, according to Proposition 3.1, the norm of the state will converge to zero as shown in Figure 6.
Figure 6

Evolution of the norm of x n .

Declarations

Acknowledgements

The first and fourth authors (M De la Sen and A Ibeas) are grateful to the Spanish Government for its support of this research through Grant DPI2012-30651, and to the Basque Government for its support of this research through Grants IT378-10 and SAIOTEK S-PE12UN015. They are also grateful to the University of Basque Country for its financial support through Grant UFI 2011/07. The second author (SL Singh) acknowledges the support by the UGC New Delhi under Emeritus Fellowship. The authors are also grateful to the referees for their valuable comments which helped to improve the manuscript.

Authors’ Affiliations

(1)
Institute of Research and Development of Processes, University of Basque Country
(2)
Pt. L. M. S. Government Autonomous Postgraduate College
(3)
Department of Mathematics, Semnan University
(4)
Department of Telecommunications and Systems Engineering, Universitat Autònoma de Barcelona, UAB
(5)
Department of Mathematics, Texas A&M University-Kingsville
(6)
Department of Mathematics, Faculty of Science, King Abdulaziz University

References

  1. Đorić D, Lazović R: Some Suzuki-type fixed point theorems for generalized multivalued mappings and applications. Fixed Point Theory Appl. 2011., 2011: Article ID 40 10.1186/1687-1812-2011-40Google Scholar
  2. Ćirić LJ: Multi-valued nonlinear contraction mappings. Nonlinear Anal. 2009, 71(7–8):2716–2723. 10.1016/j.na.2009.01.116MathSciNetView ArticleMATHGoogle Scholar
  3. Ćirić LJ: Fixed points for generalized multi-valued contractions. Mat. Vesn. 1972, 9(24):265–272.MathSciNetMATHGoogle Scholar
  4. Gordji ME, Cho YJ, Ghods S, Dehkordi MH: Coupled fixed-point theorems for contractions in partially ordered metric spaces and applications. Math. Probl. Eng. 2012., 2012: Article ID 150363 10.1155/2012/150363Google Scholar
  5. Singh SL, Mishra SN, Jain S: Round-off stability of multi-valued maps. Fixed Point Theory Appl. 2012., 2012: Article ID 12 10.1186/1687-1812-2012-12Google Scholar
  6. Singh SL, Mishra SN, Chugh R, Kamal R: General common fixed point theorems and applications. J. Appl. Math. 2012., 2012: Article ID 902312 10.1155/2012/902312Google Scholar
  7. Laowang W, Panyanak B: Common fixed points for some generalized multivalued nonexpansive mappings in uniformly convex metric spaces. Fixed Point Theory Appl. 2011., 2011: Article ID 20 10.1186/1687-1812-2011-20Google Scholar
  8. Yao Y, Noor MA, Liou YC, Kang SM: Iterative algorithms for general multivalued variational inequalities. Abstr. Appl. Anal. 2012., 2012: Article ID 768272 10.1155/2012/768272Google Scholar
  9. Khandani H, Vaezpour SM, Sims B: Common fixed points of generalized multivalued contraction in complete metric spaces. J. Comput. Anal. Appl. 2011, 13(6):1025–1038.MathSciNetMATHGoogle Scholar
  10. Abbas M: Coincidence points of multivalued f -almost nonexpansive mappings. Fixed Point Theory 2012, 13(1):3–10.MathSciNetMATHGoogle Scholar
  11. Rezapour SH, Amiri P: Fixed point of multivalued operators on ordered generalized metric spaces. Fixed Point Theory 2012, 13(1):173–178.MathSciNetMATHGoogle Scholar
  12. Petrusel A, Petrusel G: Multivalued Picard operators. J. Nonlinear Convex Anal. 2012, 13(1):157–171.MathSciNetMATHGoogle Scholar
  13. Petru TP, Petrusel A, Yao JC: Ulam-Hyers stability for operational equations and inclusions via nonself operators. Taiwan. J. Math. 2011, 15(5):2195–2212.MathSciNetMATHGoogle Scholar
  14. Gordji ME, Baghani H, Cho YJ: Coupled fixed point theorems for contractions in intuitionistic fuzzy normed spaces. Math. Comput. Model. 2011, 54(9–10):1897–1906. 10.1016/j.mcm.2011.04.014View ArticleMathSciNetMATHGoogle Scholar
  15. Nashine HK, Shatanawi W: Coupled common fixed point theorems for a pair of commuting mappings in partially ordered complete metric spaces. Comput. Math. Appl. 2011, 62: 1984–1993. 10.1016/j.camwa.2011.06.042MathSciNetView ArticleMATHGoogle Scholar
  16. Solmaz S, Shorten R, Wulff K, Cairbre FO: A design methodology for switched discrete time linear systems with applications to automotive roll dynamics control. Automatica 2008, 44(9):2358–2363. 10.1016/j.automatica.2008.01.014MathSciNetView ArticleMATHGoogle Scholar
  17. Sahu DR, Liu ZQ, Kang SM: Existence and approximation of fixed points of nonlinear mappings in spaces with weak uniform normal structure. Comput. Math. Appl. 2012, 64(4):672–685. 10.1016/j.camwa.2011.12.081MathSciNetView ArticleMATHGoogle Scholar
  18. Shatanawi W, Postolache M: Common fixed point results of mappings for nonlinear contraction of cyclic form in ordered metric spaces. Fixed Point Theory Appl. 2013., 2013: Article ID 60 10.1186/1687-1812-2013-60Google Scholar
  19. Inchan I: Viscosity iteration method for generalized equilibrium points and fixed point problems of finite family of nonexpansive mappings. Appl. Math. Comput. 2012, 219(6):2949–2959. 10.1016/j.amc.2012.09.020MathSciNetView ArticleMATHGoogle Scholar
  20. Hussain N, Pathak HK: Common fixed point and approximation for H -operator pair with applications. Appl. Math. Comput. 2012, 218(2):11217–11225.MathSciNetView ArticleMATHGoogle Scholar
  21. Saewan S, Kanjanasamranwong P, Kuman P, Cho YJ: The modified Mann type iterative algorithm for a countable family of totally quasi- φ -asymptotically nonexpansive mappings by the hybrid generalized f -projection method. Fixed Point Theory Appl. 2013., 2013: Article ID 63 10.1186/1687-1812-2013-63Google Scholar
  22. Nashine HK, Khan MS: An application of fixed point theorem to best approximation in locally convex space. Appl. Math. Lett. 2010, 23(2):121–127. 10.1016/j.aml.2009.06.025MathSciNetView ArticleMATHGoogle Scholar
  23. Shen T, Yuan Z: Stability criterion for a class of fixed-point digital filters using two’s complement arithmetic. Appl. Math. Comput. 2013, 219(9):4880–4883. 10.1016/j.amc.2012.10.064MathSciNetView ArticleMATHGoogle Scholar
  24. Reich S: Some remarks concerning contraction mappings. Can. Math. Bull. 1971, 14: 121–124. 10.4153/CMB-1971-024-9View ArticleMathSciNetMATHGoogle Scholar
  25. De la Sen M: Stable iteration procedures in metric spaces which generalize a Picard-type iteration. Fixed Point Theory Appl. 2010., 2010: Article ID 953091 10.1155/2010/953091Google Scholar
  26. Zabczyk J Modern Birkhäuser Classics. In Mathematical Control Theory. An Introduction. Birkhäuser, Boston; 1992.Google Scholar
  27. Imdad M, Erduran A: Suzuki-type generalization of Chatterjea contraction mappings on complete partial metric spaces. J. Oper. 2013., 2013: Article ID 923843Google Scholar
  28. Kadelburg Z, Nashine HK, Radenović S: Coupled fixed points in partial metric spaces. J. Adv. Math. Stud. 2013, 6(1):159–172.MathSciNetMATHGoogle Scholar
  29. Nashine HK, Kadelburg Z, Radenović S: Fixed point theorems via various cyclic contractive conditions in partial metric spaces. Publ. Inst. Math. 2013, 107: 69–93.View ArticleMathSciNetMATHGoogle Scholar
  30. Nashine HK, Kadelburg Z: Cyclic contractions and fixed point results via control functions on partial metric spaces. Int. J. Anal. 2013., 2013: Article ID 726387Google Scholar
  31. Kadelburg Z, Nashine HK, Radenović S: Common coupled fixed point results in partially ordered G -metric spaces. Bull. Math. Anal. Appl. 2012, 4(2):51–63.MathSciNetMATHGoogle Scholar
  32. De la Sen M: Some results on fixed and best proximity points of multivalued cyclic self-mappings with a partial order. Abstr. Appl. Anal. 2013., 2013: Article ID 968492 10.1155/2013/968492Google Scholar
  33. Kikkawa M, Suzuki T: Three fixed point theorems for generalized contractions with constants in complete metric spaces. Nonlinear Anal., Theory Methods Appl. 2008, 69(9):2942–2949. 10.1016/j.na.2007.08.064MathSciNetView ArticleMATHGoogle Scholar
  34. Enjouji Y, Nakanishi M, Suzuki T: A generalization of Kannan’s fixed point theorem. Fixed Point Theory Appl. 2009., 2009: Article ID 192872 10.1155/2009/192872Google Scholar
  35. Eldred AA, Veeramani P: Existence and convergence of best proximity points. J. Math. Anal. Appl. 2006, 323(2):1001–1106. 10.1016/j.jmaa.2005.10.081MathSciNetView ArticleMATHGoogle Scholar
  36. De la Sen M: Linking contractive self-mappings and cyclic Meir-Keeler contractions with Kannan self-mappings. Fixed Point Theory Appl. 2010., 2010: Article ID 572057 10.1155/2010/572057Google Scholar
  37. Karpagam S, Agrawal S: Best proximity point theorems for p -cyclic Meir-Keller contractions. Fixed Point Theory Appl. 2009., 2009: Article ID 197308 10.1155/2009/197308Google Scholar
  38. Subrahmanyam PV: Completeness and fixed points. Monatshefte Math. 1975, 80(4):325–330. 10.1007/BF01472580MathSciNetView ArticleMATHGoogle Scholar
  39. Suzuki T: A generalized Banach contraction principle that characterizes metric completeness. Proc. Am. Math. Soc. 2008, 136(5):1861–1869.View ArticleMathSciNetMATHGoogle Scholar
  40. Sintunavarat W, Kuman P: The existence theorems of an optimal approximate solution for generalized proximal contraction mappings. Abstr. Appl. Anal. 2013., 2013: Article ID 375604 10.1155/2013/375604Google Scholar
  41. De la Sen M, Ibeas A: Stability results for switched linear systems with constant discrete delays. Math. Probl. Eng. 2008., 2008: Article ID 543145 10.1155/2008/543145Google Scholar
  42. De la Sen M, Ibeas A: On the stability properties of linear time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory. Discrete Appl. Math. 2007, 155(1):7–25. 10.1016/j.dam.2006.05.003MathSciNetView ArticleMATHGoogle Scholar
  43. De la Sen M: Robust stable pole-placement based adaptive control of continuous linear systems with two parametrical estimation schemes. J. Franklin Inst. Eng. Appl. Math. 2004, 341(3):251–254.MathSciNetMATHGoogle Scholar
  44. De la Sen M, Karapinar E: On best proximity points of generalized semi-cyclic impulsive self-mappings. Applications to impulsive differential and difference equations. Abstr. Appl. Anal. 2013., 2013: Article ID 505487 10.1155/2013/505487Google Scholar
  45. Larson RE Modern Analytic and Computational Methods in Science and Mathematics. In State Increment Dynamic Programming. Elsevier, Amsterdam; 1969.Google Scholar
  46. Ratchagit M, Ratchagit K: Asymptotic stability and stabilization of fixed points for iterative sequence. Int. J. Res. Rev. Comput. Sci. 2011, 2(4):987–989.MathSciNetMATHGoogle Scholar

Copyright

© Sen et al.; licensee Springer. 2013

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.