Journal articles
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.
https://hal-amu.archives-ouvertes.fr/hal-01474415
Contributor : Elisabeth Lhuillier Connect in order to contact the contributor
Submitted on : Wednesday, February 22, 2017 - 5:24:47 PM
Last modification on : Thursday, November 4, 2021 - 11:58:07 AM
Contributor : Elisabeth Lhuillier Connect in order to contact the contributor
Submitted on : Wednesday, February 22, 2017 - 5:24:47 PM
Last modification on : Thursday, November 4, 2021 - 11:58:07 AM
Links full text
