Related papers: A Fixed Point Theorem for Non-Monotonic Functions
In this paper we consider a sufficiently broad class of nonlinear mathematical programs with disjunctive constraints, which, e.g., include mathematical programs with complemetarity/vanishing constraints. We present an extension of the…
The existence of nonzero localised periodic solutions for general one-dimensional discrete nonlinear Klein-Gordon systems with convex on-site potentials is proved. The existence problem of localised solutions is expressed in terms of a…
An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…
We apply methods of the fixed point theory to a Lambda policy iteration with a randomization algorithm for weak contractions mappings. This type of mappings covers a broader range than the strong contractions typically considered in the…
In this paper we introduce FG- coupled fixed point, which is a generalization of coupled fixed point for nonlinear mappings in partially ordered complete metric spaces. We discuss existence and uniqueness theorems of FG- coupled fixed…
We develop sufficient conditions for the existence of the weak sharp minima at infinity property for nonsmooth optimization problems via asymptotic cones and generalized asymptotic functions. Next, we show that these conditions are also…
We generalize several schedule matching theorems of Baiou-Balinski (Math. Oper. Res., 27 (2002), 485) and Alkan-Gale (J. Econ. Th. 112 (2003), 289) by applying a fixed point method of Fleiner (Math. Oper. Res., 28 (2003), 103). Thanks to a…
Suppose that E is a Banach space, {\tau} a topology under which the norm of E becomes {\tau}-lower semicontinuous and S a commuting family of {\tau}-continuous nonexpansive mappings defined on a {\tau}-compact convex subset C of E: It is…
In this paper, we investigate the existence and uniqueness of fixed point for partially ordered contraction type operators in Banach Space. We also present applications to integral and differential equations.
We prove Banach, Newton-Raphson and Brouwer fixed point theorems in the framework of generalized smooth functions, a minimal extension of Colombeau's theory (and hence of classical distribution theory) which makes it possible to model…
The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…
For an ascending correspondence $F:X\to 2^X$ with chain-complete values on a complete lattice $X$, we prove that the set of fixed points is a complete lattice. This strengthens Zhou's fixed point theorem. For chain-complete posets that are…
In this paper using Sperner's lemma for modified partition of a simplex we will constructively prove Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions.
We provide a type theoretic treatment of the paper "On Tarski's fixed point theorem" by Giovanni Curi. There are benefits to having a type theoretic formulation apart from routine implementation in a proof assistant. By taking advantage of…
We prove a fixed-point theorem that generalises and simplifies a number of results in the theory of $F$-contractions. We show that all of the previously imposed conditions on the operator can be either omitted or relaxed. Furthermore, our…
In this paper we prove a version of the Fountain Theorem for a class of nonsmooth functionals that are sum of a $C^1$ functional and a convex lower semicontinuous functional, and also a version of a theorem due to Heinz for this class of…
Dini's Theorem guarantees that a monotone sequence of continuous functions converges pointwise on a compact interval to a continuous limit that converges uniformly. In this paper, we establish new theorems generalizing Dini's result by…
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX, where k is a non-negative integer and X is a finite set of propositional atoms. We develop a theory of mca-programs. We…
We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…
Andrew Pitts' framework of relational properties of domains is a powerful method for defining predicates or relations on domains, with applications ranging from reasoning principles for program equivalence to proofs of adequacy connecting…