Proximal point algorithm for differentiable quasi-convex multiobjective optimization


Fouzia Amir, Ali Farajzadeh, Narin Petrot




The main aim of this paper is to consider the proximal point method for solving multiobjective optimization problem under the differentiability, locally Lipschitz and quasi-convex conditions of the objective function. The control conditions to guarantee that the accumulation points of any generated sequence, are Pareto critical points are provided.