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

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.

[1]  José Yunier Bello Cruz,et al.  Convergence of a projected gradient method variant for quasiconvex objectives , 2010 .

[2]  A. Bandura.  Self-Efficacy: The Exercise of Control , 1997, Journal of Cognitive Psychotherapy.

[3]  Orizon Pereira Ferreira,et al.  Unconstrained Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds , 2012, Journal of Optimization Theory and Applications.

[4]  Enrico Miglierina,et al.  Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization , 2008, Eur. J. Oper. Res..

[5]  A. Schmidt,et al.  The role of feedback, casual attributions, and self-efficacy in goal revision. , 2008, The Journal of applied psychology.

[6]  H. Murray,et al.  Explorations in Personality , 2007 .

[7]  Klaudia Beich,et al.  Theory Of Vector Optimization , 2016 .

[8]  J. Y. Bello Cruz,et al.  Convergence of the projected gradient method for quasiconvex multiobjective optimization , 2011 .

[9]  Alfredo N. Iusem,et al.  A Projected Gradient Method for Vector Optimization Problems , 2004, Comput. Optim. Appl..

[10]  P. Pintrich,et al.  Handbook of self-regulation , 2000 .

[11]  H. Simon,et al.  A Behavioral Model of Rational Choice , 1955 .

[12]  Jörg Fliege,et al.  Newton's Method for Multiobjective Optimization , 2009, SIAM J. Optim..

[13]  Boris S. Mordukhovich,et al.  Hybrid Approximate Proximal Method with Auxiliary Variational Inequality for Vector Optimization , 2010 .

[14]  Jörg Fliege,et al.  Steepest descent methods for multicriteria optimization , 2000, Math. Methods Oper. Res..

[15]  C. Tammer,et al.  Theory of Vector Optimization , 2003 .

[16]  K. Lewin.  Field theory in social science , 1951 .

[17]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[18]  A. Bandura.  Self-efficacy: toward a unifying theory of behavioral change. , 1977, Psychology Review.

[19]  C. L. Hull.  The conflicting psychologies of learning—a way out. , 1935 .

[20]  Xiaoqi Yang,et al.  Duality in optimization and variational inequalities , 2002 .

[21]  B. Zimmerman.  Attaining self-regulation: A social cognitive perspective. , 2000 .

[22]  A. Iusem,et al.  Full convergence of the steepest descent method with inexact line searches , 1995 .

[23]  K. G. Murty,et al.  Convergence of the steepest descent method for minimizing quasiconvex functions , 1996 .

[24]  Arie W. Kruglanski,et al.  A theory of goal systems. , 2002 .

[25]  B. Svaiter,et al.  A steepest descent method for vector optimization , 2005 .

[26]  Alfredo N. Iusem,et al.  Proximal Methods in Vector Optimization , 2005, SIAM J. Optim..

[27]  Ellen H. Fukuda,et al.  Inexact projected gradient method for vector optimization , 2013, Comput. Optim. Appl..

[28]  C. Lindblom.  THE SCIENCE OF MUDDLING THROUGH , 1959 .

[29]  S. Thompson.  Social Learning Theory , 2008 .

[30]  P. Roberto Oliveira,et al.  An interior proximal method in vector optimization , 2011, Eur. J. Oper. Res..

[31]  A. Bandura,et al.  Social Cognitive Theory of Organizational Management , 1989 .