Finding solutions of implicit complementarity problems by isotonicity of the metric projection

Isac and Németh [G. Isac and A. B. Németh, Projection method, isotone projection cones and the complementarity problem, J. Math. Anal. App., 153, 258-275(1990)] proved that solving a coincidence point equation (fixed point problem) in turn solves the corresponding implicit complementarity problem (nonlinear complementarity problem) and they exploited the isotonicity of the metric projection onto isotone projection cones to solve implicit complementarity problems (nonlinear complementarity problems) defined by these cones. In this paper, the notion of *-isotone projection cones is employed and an iterative algorithm is presented in connection with an implicit complementarity problem on *-isotone projection cones. It is proved that if the sequence generated through the defined algorithm is convergent, then its limit is a solution of the coincidence point equation and thus solves the implicit complementarity problem. Sufficient conditions are given for this sequence to be convergent for implicit complementarity problems defined by *-isotone projection cones. The question of finding nonzero solutions of these problems is also studied.     

Characterization of subdual latticial cones in Hilbert spaces by the isotonicity of the metric projection

The subdual latticial cones in Hilbert spaces are characterized by the isotonicity of a generalization of the positive part mapping which can be expressed in terms of the metric projection only. Although Németh characterized the positive cone of Hilbert lattices with the metric projection and ordering only [A.B. Németh, Characterization of a Hilbert vector lattice by the metric projection onto its positive cone, J. Approx. Theory 123 (2) (2003), pp. 295–299.], this has been done for the first time for subdual latticial cones in this article. We also note that the normal generating pointed closed convex cones for which the projection onto the cone is isotone are subdual latticial cones, but there are subdual latticial cones for which the metric projection onto the cone is not isotone [G. Isac, A.B. Németh, Monotonicity of metric projections onto positive cones of ordered Euclidean spaces, Arch. Math. 46 (6) (1986), pp. 568–576; G. Isac, A.B. Néemeth, Every generating isotone projection cone is latticial and correct, J. Math. Anal. Appl. 147 (1) (1990), pp. 53–62; G. Isac, A.B. Németh, Isotone projection cones in Hilbert spaces and the complementarity problem, Boll. Un. Mat. Ital. B 7 (4) (1990), pp. 773–802; G. Isac, A.B. Németh, Projection methods, isotone projection cones, and the complementarity problem, J. Math. Anal. Appl. 153 (1) (1990), pp. 258–275; G. Isac, A.B. Németh, Isotone projection cones in Eucliden spaces, Ann. Sci. Math Québec 16 (1) (1992), pp. 35–52].     

How to project onto an isotone projection cone

The solution of the complementarity problem defined by a mapping f:Rⁿ→Rⁿ and a cone K⊂Rⁿ consists of finding the fixed points of the operator P_K°(I-f), where P_K is the projection onto the cone K and I stands for the identity mapping. For the class of isotone projection cones (cones admitting projections isotone with respect to the order relation they generate) and f satisfying certain monotonicity properties, the solution can be obtained by iterative processes (see G. Isac, A.B. Németh, Projection methods, isotone projection cones, and the complementarity problem, J. Math. Anal. Appl. 153(1) (1990) 258-275 and S.Z. Németh, Iterative methods for nonlinear complementarity problems on isotone projection cones, J. Math. Anal. Appl. 350(1) (2009) 340-347). These algorithms require computing at each step the projection onto the cone K. In general, computing the projection mapping onto a cone K is a difficult and computationally expensive problem. In this note it is shown that the projection of an arbitrary point onto an isotone projection cone in Rⁿ can be obtained by projecting recursively at most n-1 times into subspaces of decreasing dimension. This emphasizes the efficiency of the algorithms mentioned above and furnishes a handy tool for some problems involving special isotone projection cones, as for example the non-negative monotone cones occurring in reconstruction problems (see e.g. Section 5.13 in J. Dattorro, Convex Optimization and Euclidean Distance Geometry, Meboo, 2005, v2009.04.11).     

Isotone retraction cones in Hilbert spaces

A mapping is called isotone if it is monotone increasing with respect to the order induced by a pointed closed convex cone. Finding the pointed closed convex generating cones for which the projection mapping onto the cone is isotone is a difficult problem which was analyzed in Isac and Németh (1986, 1990, 1992) [1], [2], [3], [4] and [5]. Such cones are called isotone projection cones. In particular it was shown that any isotone projection cone is latticial (Isac (1990) [2]). This problem is extended by replacing the projection mapping with continuous retractions onto the cone. By introducing the notion of sharp mappings, it is shown that a pointed closed convex generating cone is latticial if and only if there is a continuous retraction onto the cone whose complement is sharp. Several particular cases are considered and examples are given.     

Iterative methods for nonlinear complementarity problems on isotone projection cones

In this paper we present a recursion related to a nonlinear complementarity problem defined by a closed convex cone in a Hilbert space and a continuous mapping defined on the cone. If the recursion is convergent, then its limit is a solution of the nonlinear complementarity problem. In the case of isotone projection cones sufficient conditions are given for the mapping so that the recursion to be convergent.     

Inequalities Characterizing Coisotone Cones in Euclidean Spaces

The isotone projection cone, defined by G. Isac and A. B. Németh, is a closed pointed convex cone such that the order relation defined by the cone is preserved by the projection operator onto the cone. In this paper the coisotone cone will be defined as the polar of a generating isotone projection cone. Several equivalent inequality conditions for the coisotonicity of a cone in Euclidean spaces will be given. Thanks are due to A. B. Németh who draw the author’s attention on the relation of latticial cones generated by vectors with pairwise non-accute angles with the theory of isotone cones.     

Solving nonlinear complementarity problems by isotonicity of the metric projection

The main motivation for introducing the notion of isotone projection cones was to solve nonlinear complementarity problems. The notion of *-isotone projection cones is introduced by this paper in a similar fashion. Iterative methods for finding solutions of complementarity problems on *-isotone projection cones are presented. The problem of finding nonzero solutions of these problems is also considered.     

The non-existence of a regular exceptional family of elements. A necessary and sufficient condition. Applications to complementarity theory

This paper is the second part of our recent work [Isac and Németh, J Optim Theory Appl (forthcoming)]. Our goal is now to present some new results related to the non-existence of a regular exceptional family of elements (REFE) for a mapping and to show how can they be applied to complementarity theory.     

REFE-Acceptable Mappings: Necessary and Sufficient Condition for the Nonexistence of a Regular Exceptional Family of Elements

By considering the notion of regular exceptional family of elements (REFE), we define the class of REFE-acceptable mappings. By definition, a complementarity problem on a Hilbert space defined by a REFE-acceptable mapping and a closed convex cone has either a solution or a REFE. We present several classes of REFE-acceptable mappings. For this, neither the topological degree nor the Leray-Schauder alternative is necessary. By using the concept of REFE-acceptable mappings, we present necessary and sufficient conditions for the nonexistence of regular exceptional family of elements. These conditions are used for generating several existence theorems and existence and uniqueness theorems for complementarity problems. The authors are grateful to Prof. A.B. Németh for many helpful conversations. The research of S.Z. Németh was supported by Hungarian Research Grants OTKA T043276 and OTKA K60480.     

Some notes on the paper “Cone metric spaces and fixed point theorems of contractive mappings”

Huang and Zhang reviewed cone metric spaces in 2007 [Huang Long-Guang, Zhang Xian, Cone metric spaces and fixed point theorems of contractive mappings, J. Math. Anal. Appl. 332 (2007) 1468-1476]. We shall prove that there are no normal cones with normal constant M<1 and for each k>1 there are cones with normal constant M>k. Also, by providing non-normal cones and omitting the assumption of normality in some results of [Huang Long-Guang, Zhang Xian, Cone metric spaces and fixed point theorems of contractive mappings, J. Math. Anal. Appl. 332 (2007) 1468-1476], we obtain generalizations of the results.     

Regular exceptional family of elements with respect to isotone projection cones in Hilbert spaces and complementarity problems

Conditions for the non-existence of a regular exceptional family of elements with respect to an isotone projection cone in a Hilbert space will be presented. The obtained results will be used for generating existence theorems for a complementarity problem with respect to an isotone projection cone in a Hilbert space.     

Characterization of latticial cones in Hilbert spaces by isotonicity and generalized infimum

A mapping is called isotone if it is monotone increasing with respect to the order defined by a pointed closed convex cone. Finding the pointed closed convex generating cones for which the projection mapping onto the cone is isotone is a difficult problem which was analyzed in [1, 2, 3, 4, 5]. Such cones are called isotone projection cones. In particular it was shown that any isotone projection cone is latticial [2]. This problem is extended by replacing the projection mapping with a continuous isotone retraction onto the cone. By introducing the notion of sharp mappings, it is shown that a pointed closed convex generating cone is latticial if and only if there is a continuous isotone retraction onto the cone whose complement is sharp. This result is used for characterizing a subdual latticial cone by the isotonicity of a generalization of the positive part mapping x ↦ x ⁺. This generalization is achieved by generalizing the infimum for subdual cones. The theoretical results of this paper exhibit fundamental properties of the lattice structure of the space which were not analysed before.     

Convergence of the new composite implicit iteration process with random errors

In this paper, strong convergence theorems for approximation of common fixed points of a finite family of asymptotically demicontractive mappings are proved in Banach spaces using the new composite implicit iteration scheme with errors. Our results of this paper improve and extend the corresponding results of Chen, Song, Zhou [R.D. Chen, Y.S. Song, H.Y. Zhou, Convergence theorems for implicit iteration process for a finite family of continuous pseudocontractive mappings, J. Math. Anal. Appl. 314 (2006) 701–709], Osilike [M.O. Osilike, Implicit iteration process for common fixed points of a finite family of strictly pseudocontractive maps, J. Math. Anal. Appl. 294 (2004) 73–81], Gu [F. Gu, The new composite implicit iterative process with errors for common fixed points of a finite family of strictly pseudocontractive mappings, J. Math. Anal. Appl. 329 (2007) 766–776] and Yang and Hu [L.P. Yang, G. Hu, Convergence of implicit iteration process with random errors, Acta Math. Sinica (Chin. Ser.) 51 (1) (2008) 11–22].     

Multiple positive solutions of Dirichlet boundary value problems for second order impulsive differential equations

This paper is devoted to study the existence of multiple positive solutions for the second order Dirichlet boundary value problem with impulse effects. The main results here is the generalization of Liu and Li [L. Liu, F.Y. Li, Multiple positive solution of nonlinear two-point boundary value problems, J. Math. Anal. Appl. 203 (1996) 610-625] for ordinary differential equations. Existence is established via the theory of fixed point index in cones.     

Random Coincidence Point Theorem in Fréchet Spaces with Applications

Abstract

We proved a random coincidence point theorem for a pair of commuting random operators in the setup of Fréchet spaces. As applications, we obtained random fixed point and best approximation results for *-nonexpansive multivalued maps. Our results are generalizations or stochastic versions of the corresponding results of Shahzad and Latif [Shahzad, N.; Latif, A. A random coincidence point theorem. J. Math. Anal. Appl. 2000, 245, 633–638], Khan and Hussain [Khan, A.R.; Hussain, N. Best approximation and fixed point results. Indian J. Pure Appl. Math. 2000, 31 (8), 983–987], Tan and Yaun [Tan, K.K.; Yaun, X.Z. Random fixed point theorems and approximation. Stoch. Anal. Appl. 1997, 15 (1), 103–123] and Xu [Xu, H.K. On weakly nonexpansive and *-nonexpansive multivalued mappings. Math. Japon. 1991, 36 (3), 441–445].     

Viscosity methods for common solutions for equilibrium and hierarchical fixed point problems

Implicit and explicit viscosity methods for finding common solutions of equilibrium and hierarchical fixed points are presented. These methods are used to solve systems of equilibrium problems and variational inequalities where the involving operators are complements of nonexpansive mappings. The results here are situated on the lines of the research of the corresponding results of Moudafi [Krasnoselski-Mann iteration for hierarchical fixed-point problems, Inverse Probl. 23 (2007), pp. 1635–1640; Weak convergence theorems for nonexpansive mappings and equilibrium problems, to appear in JNCA], Moudafi and Maingé [Towards viscosity approximations of hierarchical fixed-points problems, Fixed Point Theory Appl. Art ID 95453 (2006), 10 pp.; Strong convergence of an iterative method for hierarchical fixed point problems, Pac. J. Optim. 3 (2007), pp. 529–538; Coupling viscosity methods with the extragradient algorithm for solving equilibrium problems, to appear in JNCA], Yao and Liou [Weak and strong convergence of Krasnosel'ski?–Mann iteration for hierarchical fixed point problems, Inverse Probl. 24 (2008), 015015 8 pp.], S. Takahashi and W. Takahashi [Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (2006), pp. 506–515], Xu [Viscosity method for hierarchical fixed point approach to variational inequalities, preprint.], Combettes and Hirstoaga [Equilibrium programming in Hilbert spaces, J. Nonlinear Convex Anal. 6 (2005), pp. 117–136] and Plubtieng and Pumbaeang [A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 336 (2007), pp. 455–469.].     

Generalized viscosity implicit rules for solving quasi-inclusion problems of accretive operators in Banach spaces

The generalized viscosity implicit rules for solving quasi-inclusion problems of accretive operators in Banach spaces are established. The strong convergence theorems of the rules to a solution of quasi-inclusion problems of accretive operators are proved under certain assumptions imposed on the sequences of parameters. The results presented in this paper extend and improve the main results of Refs. (Moudafi, J Math Anal Appl. 2000;241:46–55; Xu et al., Fixed Point Theory Appl. 2015;2015:41; López et al., Abstr Appl Anal. 2012;2012; Cholamjiak, Numer Algor. DOI:10.1007/s11075-015-0030-6.). Moreover, some applications to monotone variational inequalities, convex minimization problem and convexly constrained linear inverse problem are presented.     

Convergence theorems for implicit iteration process for a finite family of continuous pseudocontractive mappings

In this paper, a necessary and sufficient conditions for the strong convergence to a common fixed point of a finite family of continuous pseudocontractive mappings are proved in an arbitrary real Banach space using an implicit iteration scheme recently introduced by Xu and Ori [H.K. Xu, R.G. Ori, An implicit iteration process for nonexpansive mappings, Numer. Fuct. Anal. Optim. 22 (2001) 767-773] in condition αn∈(0,1], and also strong and weak convergence theorem of a finite family of strictly pseudocontractive mappings of Browder-Petryshyn type is obtained. The results presented extend and improve the corresponding results of M.O. Osilike [M.O. Osilike, Implicit iteration process for common fixed points of a finite family of strictly pseudocontractive maps, J. Math. Anal. Appl. 294 (2004) 73-81].     

The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem

The symmetric cone complementarity problem (denoted by SCCP) is a broad class of optimization problems, which contains the semidefinite complementarity problem, the second-order cone complementarity problem, and the nonlinear complementarity problem. In this paper we first extend the smoothing function proposed by Huang et al. (Sci. China 44:1107–1114, 2001) for the nonlinear complementarity problem to the context of symmetric cones and show that it is coercive under suitable assumptions. Based on this smoothing function, a smoothing-type algorithm, which is a modified version of the Qi-Sun-Zhou method (Qi et al. in Math. Program. 87:1–35, 2000), is proposed for solving the SCCP. By using the theory of Euclidean Jordan algebras, we prove that the proposed algorithm is globally and locally quadratically convergent under suitable assumptions. Preliminary numerical results for some second-order cone complementarity problems are reported which indicate that the proposed algorithm is effective.     

A projection-filter method for solving nonlinear complementarity problems

The Josephy-Newton method attacks nonlinear complementarity problems which consists of solving, possibly inexactly, a sequence of linear complementarity problems. Under appropriate regularity assumptions, this method is known to be locally (superlinearly) convergent. Utilizing the filter method, we presented a new globalization strategy for this Newton method applied to nonlinear complementarity problem without any merit function. The strategy is based on the projection-proximal point and filter methodology. Our linesearch procedure uses the regularized Newton direction to force global convergence by means of a projection step which reduces the distance to the solution of the problem. The resulting algorithm is globally convergent to a solution. Under natural assumptions, locally superlinear rate of convergence was established.