Add to ORKGWe introduce an interior proximal point algorithm with proximal distances to solve quasimonotone Equilibrium problems defined on convex sets. Under adequate assumptions, we prove that the sequence generated by the algorithm converges to a solution of the problem and for a broad class of proximal distances the rate of convergence of the sequence is linear or superlinear
International audienceIn this article, we introduce a new proximal interior point algorithm (PIPA). ...
We introduce a proximal algorithm using quasidistances for multiobjective minimization problems with...
The paper introduces and analysizes the convergence of two multi-step proximal-like algorithms for p...
The paper introduces a proximal point algorithm for solving equilibrium problems on convex sets with...
We consider a general equilibrium problem defined on a convex set, whose cost bifunction may be nonm...
Abstract. A globally convergent algorithm for solving equilibrium prob-lems is proposed. The algorit...
Using a slightly modified concept of Bregman functions, we suggest a Bregman proximal interior point...
This paper introduces an inexact proximal point algorithm using proximal distances with linear and s...
International audienceWe consider a bilevel problem involving two monotone equilibrium bifunctions a...
In this paper we introduce an inexact proximal point algorithm using proximal distances for solving ...
This paper concerns developing two hybrid proximal point methods (PPMs) for finding a common solutio...
The main objective of this study is to introduce a new two-step proximal-type method to solve equili...
We compute constrained equilibria satisfying an optimality condition. Important examples include con...
ABSTRACT In this paper we propose an inexact proximal point method to solve multiobjective minimiza...
International audienceWe present an inexact proximal point algorithm using quasi distances to solve ...
International audienceIn this article, we introduce a new proximal interior point algorithm (PIPA). ...
We introduce a proximal algorithm using quasidistances for multiobjective minimization problems with...
The paper introduces and analysizes the convergence of two multi-step proximal-like algorithms for p...
The paper introduces a proximal point algorithm for solving equilibrium problems on convex sets with...
We consider a general equilibrium problem defined on a convex set, whose cost bifunction may be nonm...
Abstract. A globally convergent algorithm for solving equilibrium prob-lems is proposed. The algorit...
Using a slightly modified concept of Bregman functions, we suggest a Bregman proximal interior point...
This paper introduces an inexact proximal point algorithm using proximal distances with linear and s...
International audienceWe consider a bilevel problem involving two monotone equilibrium bifunctions a...
In this paper we introduce an inexact proximal point algorithm using proximal distances for solving ...
This paper concerns developing two hybrid proximal point methods (PPMs) for finding a common solutio...
The main objective of this study is to introduce a new two-step proximal-type method to solve equili...
We compute constrained equilibria satisfying an optimality condition. Important examples include con...
ABSTRACT In this paper we propose an inexact proximal point method to solve multiobjective minimiza...
International audienceWe present an inexact proximal point algorithm using quasi distances to solve ...
International audienceIn this article, we introduce a new proximal interior point algorithm (PIPA). ...
We introduce a proximal algorithm using quasidistances for multiobjective minimization problems with...
The paper introduces and analysizes the convergence of two multi-step proximal-like algorithms for p...