The self regulation problem as an inexact steepest descent method for multicriteria optimization - Aix-Marseille Université Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2014

The self regulation problem as an inexact steepest descent method for multicriteria optimization

Résumé

In this paper we study an inexact steepest descent method for multicriteria optimization whose step-size comes with Armijo's rule. We show that this method is well-defined. Moreover, by assuming the quasi-convexity of the multicriteria function, we prove full convergence of any generated sequence to a Pareto critical point. As an application, we offer a model for the Psychology's self regulation problem, using a recent variational rationality approach.

Dates et versions

hal-01474415 , version 1 (22-02-2017)

Identifiants

Citer

Glaydston Carvalho Bento, Joao Xavier Neto, Paulo Roberto Oliveira, Antoine Soubeyran. The self regulation problem as an inexact steepest descent method for multicriteria optimization. European Journal of Operational Research, 2014, 235 (3), pp.494--502. ⟨10.1016/j.ejor.2014.01.002⟩. ⟨hal-01474415⟩
56 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More