A Trust-Region Method for Unconstrained Multiobjective Problems with Applications in Satisficing Processes

Multiobjective optimization has a significant number of real-life applications. For this reason, in this paper we consider the problem of finding Pareto critical points for unconstrained multiobjective problems and present a trust-region method to solve it. Under certain assumptions, which are derived in a very natural way from assumptions used to establish convergence results of the scalar trust-region method, we prove that our trust-region method generates a sequence which converges in the Pareto critical way. This means that our generalized marginal function, which generalizes the norm of the gradient for the multiobjective case, converges to zero. In the last section of this paper, we give an application to satisficing processes in Behavioral Sciences. Multiobjective trust-region methods appear to be remarkable specimens of much more abstract satisficing processes, based on “variational rationality” concepts. One of their important merits is to allow for efficient computations. This is a striking result in Behavioral Sciences.

[1]  Peng Ye-hui.  Nonmonotone Trust Region Algorithms for Multiobjective Programming with Linear Constraints , 2002 .

[2]  Philip E. Gill,et al.  A Subspace Minimization Method for the Trust-Region Step , 2009, SIAM J. Optim..

[3]  Philippe L. Toint,et al.  A retrospective trust-region method for unconstrained optimization , 2010, Math. Program..

[4]  Qian Zhou,et al.  A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming , 2009, Appl. Math. Comput..

[5]  J. Bolte,et al.  Alternating Proximal Algorithms for Weakly Coupled Minimization Problems. Applications to Dynamical Games and PDE’s , 2008 .

[6]  Milanka Gardasevic Filipovic.  A TRUST REGION METHOD USING SUBGRADIENT FOR MINIMIZING A NONDIFFERENTIABLE FUNCTION , 2009 .

[7]  Juan Enrique Martínez-Legaz,et al.  A tabu search scheme for abstract problems, with applications to the computation of fixed points , 2008 .

[8]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[9]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[10]  Dinh The Luc,et al.  Maximal Elements Under Reference-Dependent Preferences with Applications to Behavioral Traps and Games , 2012, Journal of Optimization Theory and Applications.

[11]  Ji Lin,et al.  A Trust Region Algorithm with Memory for Equality Constrained Optimization , 2008 .

[12]  Ou Yigui,et al.  A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming , 2009 .

[13]  Antoine Soubeyran,et al.  Learning how to Play Nash, Potential Games and Alternating Minimization Method for Structured Nonconvex Problems on Riemannian Manifolds , 2013 .

[14]  H. Attouch,et al.  Local Search Proximal Algorithms as Decision Dynamics with Costs to Move , 2011 .

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

[16]  Hédy Attouch,et al.  Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality , 2008, Math. Oper. Res..

[17]  Patrick Redont,et al.  A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move , 2007, SIAM J. Optim..

[18]  Zhenjun Shi,et al.  A new trust region method for unconstrained optimization , 2008 .

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

[20]  Masoud Ahookhosh,et al.  Computers and Mathematics with Applications a Nonmonotone Trust Region Method with Adaptive Radius for Unconstrained Optimization Problems , 2022 .

[21]  Yijun Li,et al.  A new nonmonotone trust-region method of conic model for solving unconstrained optimization , 2010, J. Comput. Appl. Math..

[22]  Sjur Didrik Flåm,et al.  Gradient differences and bilateral barters , 2014 .

[23]  Kurt Lewin,et al.  Level of aspiration. , 1944 .

[24]  João X. da Cruz Neto,et al.  A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant , 2010, Eur. J. Oper. Res..

[25]  A. Bandura,et al.  Cultivating competence, self-efficacy, and intrinsic interest through proximal self-motivation. , 1981 .

[26]  Michel Laroche,et al.  Evoked Set Formation and Composition: an Empirical Investigation Under a Routinized Response Behavior Situation , 1981 .

[27]  J. Dietz.  Satisfaction: A Behavioral Perspective on the Consumer , 1997 .

[28]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[29]  Antoine Soubeyran,et al.  Existence of solutions in variational relation problems without convexity , 2010 .