The self regulation problem as an inexact steepest descent method for multicriteria optimization - Aix-Marseille Université Access content directly
Journal Articles European Journal of Operational Research Year : 2014

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

Abstract

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 and versions

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

Identifiers

Cite

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⟩
57 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More