On Olaleru’s open problem on Gregus fixed point theorem

Let (X, d) be a complete metric space and ${TX \longrightarrow X }$ be a mapping with the property d(Tx, Ty) ≤ ad(x, y) + bd(x, Tx) + cd(y, Ty) + ed(y, Tx) + fd(x, Ty) for all ${x, y \in X}$ , where 0 < a < 1, b, c, e, f ≥ 0, a + b + c + e + f = 1 and b + c > 0. We show that if e + f > 0 then T has a unique fixed point and also if e + f ≥ 0 and X is a closed convex subset of a complete metrizable topological vector space (Y, d), then T has a unique fixed point. These results extend the corresponding results which recently obtained in this field. Finally by using our main results we give an answer to the Olaleru’s open problem.     

Variational iteration method: Green’s functions and fixed point iterations perspective

The aim of this article is to demonstrate that the variational iteration method “VIM” is in many instances a version of fixed point iteration methods such as Picard’s scheme. In a wide range of problems, the correction functional resulting from the VIM can be interpreted and/or formulated from well-known fixed point strategies using Green’s functions. A number of examples are included to assert the validity of our claim. The test problems include first and higher order initial value problems.     

Around Browder’s fixed point theorem for contractions

We revisit a fixed point theorem for contractions established by Felix Browder in 1968. We show that many definitions of contractive mappings which appeared in the literature after 1968 turn out to be equivalent formulations or even particular cases of Browder’s definition. We also discuss the problem of the existence of approximate fixed points of continuous mappings; in particular, we settle it in the affirmative for Browder contractions. Finally, we recall three problems concerning Browder contractions which remain unsolved. With great respect for Professor Felix E. Browder     

Several generalizations of Tverberg’s theorem

In a generalization of Radon’s theorem, Tverberg showed that each setS of at least (d+1) (r ? 1)+1 points inR ^d has anr-partition into (pair wise disjoint) subsetsS =S ₁ ∪ … ∪S _r so that \(\bigcap\nolimits_i^r {\underline{\underline {}} } _1 \) convS _i # Ø. This note considers the following more general problems: (1) How large mustS σR ^d be to assure thatS has anr-partitionS=S ₁∪ … ∪S _r so that eachn members of the family {convS _i ～ _i-1 ^r have non-empty intersection, where 1<=n<=r. (2) How large mustS ∪R ^d be to assure thatS has anr-partition for which \(\bigcap\nolimits_i^r {\underline{\underline {}} } _1 \) convS _r is at least 1-dimensional.     

On a generalization of a Greguš fixed point theorem

Let C be a closed convex subset of a complete convex metric space X. In this paper a class of selfmappings on C, which satisfy the nonexpansive type condition (2) below, is introduced and investigated. The main result is that such mappings have a unique fixed point.     

Mizoguchi–Takahashi’s type common fixed point theorem

Recently Kamran extended the result of Mizoguchi and Takahashi for closed multi-valued mappings and proved a fixed point theorem. In this paper we further extend the result concluded by Kamran and prove a common fixed point theorem by using the concept of lower semi-continuity.     

The Sandwich theorem via Pataraia’s fixed point theorem

Positivity - The Sandwich theorem (König in Archiv der Mathematik 23:500–1972, 1972) yields the existence of a linear functional sandwiched in between a given superlinear functional and...     

Generalizations of Darbo’s fixed point theorem and solvability of integral and differential systems

In this paper, we establish some new generalizations of Darbo’s fixed point theorem for multivalued mappings. Moreover, we prove the existence of solutions for a class of integral equations by Darbo’s fixed point theorem and the existence of solutions for a class of differential inclusions using a generalization of Darbo’s fixed point theorem.     

An extension of Matkowski’s and Wardowski’s fixed point theorems with applications to functional equations

Aequationes mathematicae - In this paper, we prove a fixed point theorem for a system of maps on the finite product of metric spaces. Our result generalizes the result of Matkowski (Bull Acad Pol...     

On Ulm’s method using divided differences of order one

We provide new sufficient convergence conditions for the semilocal convergence of Ulm’s method (Tzv Akad Nauk Est SSR 16:403–411, 1967) in order to approximate a locally unique solution of an equation in a Banach space setting. We show that in some cases, our hypotheses hold true but the corresponding ones in Burmeister (Z Angew Math Mech 52:101–110, 1972), Kornstaedt (Aequ Math 13:21–45, 1975), Moser (1973), and Potra and Pták (Cas Pest Mat 108:333–341, 1983) do not. We also show that under the same hypotheses and computational cost, finer error bounds can be obtained. Some error bounds are also shown to be sharp. Numerical examples are also provided further validating the results.     

A novel Ishikawa–Green’s fixed point scheme for the solution of BVPs

In this article, a new numerical approach is introduced for the numerical solution of a wide class of boundary value problems (BVPs). The underlying strategy of the algorithm is based on embedding an integral operator, defined in terms of Green’s function, into Ishikawa fixed point iteration scheme. The validity of the method is demonstrated by a number of examples that confirm the applicability and high efficiency of the method. The absolute error or residual error computations show that the current technique provides highly accurate approximations.     

Newton’s method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation

We consider the generalized Nash equilibrium problem (GNEP), where not only the players’ cost functions but also their strategy spaces depend on the rivals’ decision variables. Existence results for GNEPs are typically shown by using a fixed point argument for a certain set-valued function. Here we use a regularization of this set-valued function in order to obtain a single-valued function that is easier to deal with from a numerical point of view. We show that the fixed points of the latter function constitute an important subclass of the generalized equilibria called normalized equilibria. This fixed point formulation is then used to develop a nonsmooth Newton method for computing a normalized equilibrium. The method uses a so-called computable generalized Jacobian that is much easier to compute than Clarke generalized Jacobian or B-subdifferential. We establish local superlinear/quadratic convergence of the method under the constant rank constraint qualification, which is weaker than the frequently used linear independence constraint qualification, and a suitable second-order condition. Some numerical results are presented to illustrate the performance of the method.     

Strong convergence of a regularization method for Rockafellar’s proximal point algorithm

In this paper, for a monotone operator T, we shall show strong convergence of the regularization method for Rockafellar’s proximal point algorithm under more relaxed conditions on the sequences {r _k } and {t _k }, $$\lim\limits_{k\to\infty}t_k = 0;\quad \sum\limits_{k=0}^{+\infty}t_k = \infty;\quad\ \liminf\limits_{k\to\infty}r_k > 0.$$ Our results unify and improve some existing results.     

On solving the problems of stability by Lyapunov’s direct method

We consider problems of stability and instability of the trivial solution to nonautonomous systems of differential equations. We suggest new theorems of Lyapunov’s direct method with the use of semi-definite auxiliary functions. The idea is based on the use of the additional function that evaluates the rate of convergence of the solutions to the set, where Lyapunov’s function vanishes. We formulate theorems on the non-asymptotic stability and instability. The results are illustrated by examples, where we give a comparison with known results.     

On the attraction of Newton’s method to critical lagrange multipliers

The attraction of dual trajectories of Newton’s method for the Lagrange system to critical Lagrange multipliers is analyzed. This stable effect, which has been confirmed by numerical practice, leads to the Newton-Lagrange method losing its superlinear convergence when applied to problems with irregular constraints. At the same time, available theoretical results are of “negative” character; i.e., they show that convergence to a noncritical multiplier is not possible or unlikely. In the case of a purely quadratic problem with a single constraint, a “positive” result is proved for the first time demonstrating that the critical multipliers are attractors for the dual trajectories. Additionally, the influence exerted by the attraction to critical multipliers on the convergence rate of direct and dual trajectories is characterized.     

On the enumerative nature of Gomory’s dual cutting plane method

For 30 years after their invention half a century ago, cutting planes for integer programs have been an object of theoretical investigations that had no apparent practical use. When they finally proved their practical usefulness in the late eighties, that happened in the framework of branch and bound procedures, as an auxiliary tool meant to reduce the number of enumerated nodes. To this day, pure cutting plane methods alone have poor convergence properties and are typically not used in practice. Our reason for studying them is our belief that these negative properties can be understood and thus remedied only based on a thorough investigation of such procedures in their pure form. In this paper, the second in a sequence, we address some important issues arising when designing a computationally sound pure cutting plane method. We analyze the dual cutting plane procedure proposed by Gomory in 1958, which is the first (and most famous) convergent cutting plane method for integer linear programming. We focus on the enumerative nature of this method as evidenced by the relative computational success of its lexicographic version (as documented in our previous paper on the subject), and we propose new versions of Gomory’s cutting plane procedure with an improved performance. In particular, the new versions are based on enumerative schemes that treat the objective function implicitly, and redefine the lexicographic order on the fly to mimic a sound branching strategy. Preliminary computational results are reported.     

On solving systems of linear algebraic equations by Gibbs’s method

The paper presents an algorithm of approximate solution of a system of linear algebraic equations by the Monte Carlo method superimposed with ideas of simulating Gibbs and Metropolis fields. A solution in the form of a Neumann series is evaluated, the whole vector of solutions is obtained. The dimension of a system may be quite large. Formulas for evaluating the covariance matrix of a single simulation run are given. The method of solution is conceptually linked to the method put forward in a 2009 paper by Ermakov and Rukavishnikova. Examples of 3 × 3 and 100 × 100 systems are considered to compare the accuracy of approximation for the method proposed, for Ermakov and Rukavishnikova’s method and for the classical Monte Carlo method, which consists in consecutive estimation of the components of an unknown vector.