Weak chain-completeness and fixed point property for pseudo-ordered sets

In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as an extension of the notion of chain-completeness of posets (see [3]) and it is shown that every isotone map of a weakly chain-complete pseudo-ordered set into itself has a least fixed point.     

On coincidences of families of mappings on ordered sets

New results on fixed points and coincidences of families of set-valued mappings of partially ordered sets obtained without commutativity assumptions are presented. These results develop theorems on fixed points of an isotone self-mapping of an ordered set (for families of set-valued mappings) and theorems about coincidences of two set-valued mappings one of which is isotone and the other is covering (for finite families of set-valued mappings).     

Isotonicity of the Metric Projection and Complementarity Problems in Hilbert Spaces

In this paper, as the extension of the isotonicity of the metric projection, the isotonicity characterizations with respect to two arbitrary order relations induced by cones of the metric projection operator are studied in Hilbert spaces, when one cone is a subdual cone and some relations between the two orders hold. Moreover, if the metric projection is not isotone in the whole space, we prove that the metric projection is isotone in some domains in both Hilbert lattices and Hilbert quasi-lattices. By using the isotonicity characterizations with respect to two arbitrary order relations of the metric projection, some solvability and approximation theorems for the complementarity problems are obtained. Our results generalize and improve various recent results in the field of study.     

Wreath products of ordered semigroups

In this paper ordered wreath products of ordered monoids by ordered acts are investigated. In 4. we characterize idempotent isotone wreath products. In 3. the monoid of order preserving endomorphisms of a free ordered act is represented as Cartesian ordered isotone wreath product. Moreover, we give conditions for this wreath product to be I-regular.     

Common fixed points of a family of commuting mappings of partially ordered sets.

The paper presents conditions providing the existence of a common fixed point of a family of commuting isotone multivalued mappings of a partially ordered set and the existence of the minimal element in the set of common fixed points. Additional conditions that guarantee the existence of the least element in that point set are also presented. Relations of the obtained results to well-known fixed point theorems are discussed.     

An extension of Tarski's fixed point theorem and its application to isotone complementarity problems

Tarski's fixed point theorem is extended to the case of set-valued mappings, and is applied to a class of complementarity problems defined by isotone set-valued operators in a complete vector lattice.     

A general approach to fuzzy concepts

The paper proposes a flexible way to build concepts within fuzzy logic and set theory. The framework is general enough to capture some important particular cases, with their own independent interpretations, like “antitone” or “isotone” concepts constructed from fuzzy binary relations, but also to allow the two universes (of objects and attributes) to be equipped each with its own truth structure. Perhaps the most important feature of our approach is that we do not commit ourselves to any kind of logical connector, covering thus the case of a possibly non‐commutative conjunction too. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Implicit complementarity problems on isotone projection cones

Isac and Németh [G. Isac and A. B. Németh, Projection methods, isotone projection cones and the complementarity problem, J. Math. Anal. Appl. 153 (1990), pp. 258–275] 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 article an iterative algorithm is studied in connection with an implicit complementarity problem. 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, extending the results of Németh [S.Z. Németh, Iterative methods for nonlinear complementarity problems on isotone projection cones, J. Math. Anal. Appl. 350 (2009), pp. 340–370]. Some existing concepts from the latter paper are extended to solve the problem of finding nonzero solutions of the implicit complementarity problem.     

Images of simple lattice polynomials

Although lattice polynomials, built from the two binary lattice operations and involving constants of the lattice, are mechanical devices to produce isotone self-maps, there is no order-theoretical property common to all lattice polynomial images. This contrasts with the current fact that little is known about isotone self-maps whose images are not, themselves, lattices. It also shuts out an obvious approach to the conjecture that every order polynomial complete lattice is finite.Presented by R. Freese.     

Wreath products of ordered semigroups

In this part of the paper we give necessary and sufficient conditions for ordered wreath products of ordered semigroups by ordered acts to be inverse. In addition for Cartesian ordered wreath products we give conditions under which passing to inverses is isotone or antitone.     

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.     

Two Order Invariants Related to the Fixed Point Property

We introduce two numerical invariants of orders that measure how close a poset is to having the fixed point property. We give general properties of those invariants and link them to known results on the fixed point property.     

多元积分中值定理的中间点(英文)

研究了多元球体上的积分中值定理的中间点的渐近性质,证明了当球体半径趋于0时,中间点近似落在过球体中心的切平面上.     

Generalized isotone projection cones

This article extends the notion of isotone projection cones to generalized isotone projection cones by replacing the usual metric projection with a generalized one. It is shown that all such cones are simplicial.     

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.     

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.     

On asynchronous iterations in partially ordered spaces

We extend the idea of asynchronous iterations to self-mappings of product spaces with infinitely many components. In addition to giving a rather general convergence theorem we study in some detail the case of isotone and isotonically decomposable mappings in partially ordered spaces. In particular, we obtain relationships between asynchronous iterations and the total step method and results on enclosures for fixed points. They appear to be new, even for mappings defined on a product space with only finitely many components.     

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).     

Distortion and stability of the fixed point property for non-expansive mappings

Let X be a Banach space. We say that X satisfies the fixed point property (weak fixed point property) if every non-expansive mapping defined from a convex closed bounded (convex weakly compact) subset of X into itself has a fixed point. We say that X satisfies the stable fixed point property (stable weak fixed point property) if the same is true for every equivalent norm which is close enough to the original one. Denote by P(X) the set formed by all equivalent norms with the topology of the uniform convergence on the unit ball of X. We prove that the subset of P(X) formed by the norms failing the fixed point property is dense in P(X) when X is a non-distortable space which fails the fixed point property. In particular, no renorming of ?₁ can satisfy the stable fixed point property. Furthermore, we show some examples of distortable spaces failing the weak fixed point property, which can be renormed to satisfy the stable weak fixed point property. As a consequence we prove that every separable Banach space can be renormed to satisfy the stable weak fixed point property.     

Isotone cones in Banach spaces and applications to best approximations of operators without continuity conditions

In this paper, we introduce the concept of isotone cones in Banach spaces. Then, we apply the order monotonic property of the metric projection operator to prove the existence of best approximations for some operators without continuity conditions in partially ordered Banach spaces.