A Lyusternik–Graves theorem for the proximal point method

We consider a generalized version of the proximal point algorithm for solving the perturbed inclusion y∈T(x), where y is a perturbation element near 0 and T is a set-valued mapping acting from a Banach space X to a Banach space Y which is metrically regular around some point $({\bar{x}},0)$ in its graph. We study the behavior of the convergent iterates generated by the algorithm and we prove that they inherit the regularity properties of T, and vice versa. We analyze the cases when the mapping T is metrically regular and strongly regular.     

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.     

A new approach to the Assad–Kirk fixed point theorem

In the present paper, considering the Wardowski’s technique, we give a new approach to the Assad–Kirk fixed point theorem on metrically convex metric spaces.We also provide a nontrivial example showing that our result is a proper extension of the Assad–Kirk fixed point theorem.     

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.     

Chasles’ fixed point theorem for Euclidean motions

Chasles’ theorem, a classic and important result of kinematics, states that every orientation-preserving isometry of ${\mathbb{R}^3}$ is a screw motion. We show that this is equivalent to the assertion that each proper Euclidean motion that is not a pure translation, acting on the space of oriented lines, has a unique fixed point (the axis of the screw motion). We use that formulation to derive a simple and novel constructive proof of Chasles’ theorem.     

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     

A note on a fixed point theorem and the Hyers–Ulam stability

We present a theorem that is a simultaneous generalization of the classical Banach fixed point theorem and a theorem of G.L. Forti on the Hyers–Ulam stability (of difference and functional equations). We also give an example that shows how to use that result in finding the solutions of some difference equations.     

Impulsive boundary value problems for p(t)-Laplacian’s via critical point theory

In this paper we investigate the existence of solutions to impulsive problems with a p(t)-Laplacian and Dirichlet boundary value conditions. We introduce two types of solutions, namely a weak and a classical one which coincide because of the fundamental lemma of the calculus of variations. Firstly we investigate the existence of solution to the linear problem, i.e. a problem with a fixed rigth hand side. Then we use a direct variational method and next a mountain pass approach in order to get the existence of at least one weak solution to the nonlinear problem.     

A primal–dual interior point method for nonlinear semidefinite programming

This paper is concerned with a primal–dual interior point method for solving nonlinear semidefinite programming problems. The method consists of the outer iteration (SDPIP) that finds a KKT point and the inner iteration (SDPLS) that calculates an approximate barrier KKT point. Algorithm SDPLS uses a commutative class of Newton-like directions for the generation of line search directions. By combining the primal barrier penalty function and the primal–dual barrier function, a new primal–dual merit function is proposed. We prove the global convergence property of our method. Finally some numerical experiments are given.     

A soft version of the Knaster–Tarski fixed point theorem with applications

In this paper, first, we define a partial order on a soft set (F, A) and introduce some related concepts. Then, using the concept of a soft mapping introduced by Babitha and Sunil (Comput Math Appl 60(7):1840–1849, 2010), a soft version of Knaster–Tarski fixed point theorem is obtained. Some examples are presented to support the concepts introduced and the results proved herein. As an application of our result, we show that the soft Knaster–Tarski fixed point theorem ensures the existence of a soft common fixed point for a commuting family of order-preserving soft mappings.     

A fixed point theorem in G-metric spaces via α-series

Abstract

In the context of G-metric spaces we prove a common fixed point theorem for a sequence of self mappings using a new concept of α-series.     

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.     

A method for calculating the Painlevé transcendents

A numerical method for solving the Cauchy problem for all the six Painlevé equations is proposed. The difficulty of solving these equations is that the unknown functions can have movable (that is, dependent on the initial data) singular points of the pole type. Moreover, the Painlevé III–VI equations may have singularities at points where the solution takes certain finite values. The positions of all these singularities are not a priori known and are determined in the process of solving the equation. The proposed method is based on the transition to auxiliary systems of differential equations in neighborhoods of the indicated points. The equations in these systems and their solutions have no singularities at the corresponding point and its neighborhood. Such auxiliary equations are derived for all Painlevé equations and for all types of singularities. Efficient criteria for transition to auxiliary systems are formulated, and numerical results illustrating the potentials of the method are presented.     

On boundary value problems for the ϕ-Laplacian

For the φ-Laplacian, we consider a boundary value problem with functional boundary conditions. The Dirichlet problem is a special case of this problem.