International audienceWe propose an inertial proximal point method for variational inclusion involving difference of two maximal monotone vector fields in Hadamard manifolds. We prove that if the sequence generated by the method is bounded, then every cluster point is a solution of the non-monotone variational inclusion. Some sufficient conditions for boundedness and full convergence of the sequence are presented. The efficiency of the method is verified by numerical experiments comparing its performance with classical versions of the method for monotone and non-monotone problems
The Proximal Point Algorithm (PPA) is a method for solving inclusions of the form 0 2 T (z) where T ...
Abstract The purpose of this article is to propose a modified viscosity implicit-type proximal point...
We glance at recent advances to the general theory of maximal set-valued monotone mappings and thei...
International audienceWe propose an inertial proximal point method for variational inclusion involvi...
International audienceWe propose an inertial proximal point method for variational inclusion involvi...
Abstract. The problem of finding the singularities of monotone vectors fields on Hadamard manifolds ...
This paper presents an extragradient method for variational inequality associated with a point-to-se...
In this article, we introduce a forward–backward splitting method with a new step size rule for find...
In this article, we introduce a forward–backward splitting method with a new step size rule for find...
In the present paper, we consider inexact proximal point algorithms for finding singular points of m...
Abstract The purpose of this paper is to propose a modified proximal point algorithm for solving min...
In this paper we propose an extension of the proximal point method to solve minimization problems wi...
For the problem of solving maximal monotone inclusions, we present a rather general class of algorit...
This paper presents and analyzes a strongly convergent approximate proximal point algorithm for find...
Some existing decomposition methods for solving a class of variational inequalities (VIs) with separ...
The Proximal Point Algorithm (PPA) is a method for solving inclusions of the form 0 2 T (z) where T ...
Abstract The purpose of this article is to propose a modified viscosity implicit-type proximal point...
We glance at recent advances to the general theory of maximal set-valued monotone mappings and thei...
International audienceWe propose an inertial proximal point method for variational inclusion involvi...
International audienceWe propose an inertial proximal point method for variational inclusion involvi...
Abstract. The problem of finding the singularities of monotone vectors fields on Hadamard manifolds ...
This paper presents an extragradient method for variational inequality associated with a point-to-se...
In this article, we introduce a forward–backward splitting method with a new step size rule for find...
In this article, we introduce a forward–backward splitting method with a new step size rule for find...
In the present paper, we consider inexact proximal point algorithms for finding singular points of m...
Abstract The purpose of this paper is to propose a modified proximal point algorithm for solving min...
In this paper we propose an extension of the proximal point method to solve minimization problems wi...
For the problem of solving maximal monotone inclusions, we present a rather general class of algorit...
This paper presents and analyzes a strongly convergent approximate proximal point algorithm for find...
Some existing decomposition methods for solving a class of variational inequalities (VIs) with separ...
The Proximal Point Algorithm (PPA) is a method for solving inclusions of the form 0 2 T (z) where T ...
Abstract The purpose of this article is to propose a modified viscosity implicit-type proximal point...
We glance at recent advances to the general theory of maximal set-valued monotone mappings and thei...