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

被引:26
作者
Villacorta, Kely D. V. [1 ]
Oliveira, Paulo R. [2 ,3 ]
Soubeyran, Antoine [4 ,5 ]
机构
[1] Univ Fed Paraiba, DCC CI, BR-58051900 Joao Pessoa, Paraiba, Brazil
[2] Univ Fed Rio de Janeiro, PESC COPPE, Rio De Janeiro, Brazil
[3] Ctr Tecnol, BR-2194197 Rio De Janeiro, Brazil
[4] Aix Marseille Univ, Aix Marseille Sch Econ, CNRS, F-13290 Chateau Lafarge, Les Milles, France
[5] EHESS, F-13290 Chateau Lafarge, Les Milles, France
关键词
Trust-region methods; Unconstrained multiobjective problem; Pareto critical point; Satisficing process; Worthwhile change; Variational rationality; ALTERNATING MINIMIZATION; CONVEX MINIMIZATION; NONCONVEX PROBLEMS; ALGORITHMS; GAMES;
D O I
10.1007/s10957-013-0392-7
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:865 / 889
页数:25
相关论文
共 36 条
[1]   A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems [J].
Ahookhosh, Masoud ;
Amini, Keyvan .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (03) :411-422
[2]  
[Anonymous], 1999, SPRINGER SCI
[3]  
[Anonymous], TRUST REGION METHODS, DOI DOI 10.1137/1.9780898719857
[4]  
[Anonymous], VARIATIONAL RA UNPUB
[5]  
[Anonymous], 2009, Variational rationality, a theory of individual stability and change: worthwhile and ambidextry behaviors
[6]  
[Anonymous], 1995, NONLINEAR PROGRAMMIN
[7]  
Attouch H, 2008, J CONVEX ANAL, V15, P485
[8]   A new class of alternating proximal minimization algorithms with costs-to-move [J].
Attouch, H. ;
Redont, P. ;
Soubeyran, A. .
SIAM JOURNAL ON OPTIMIZATION, 2007, 18 (03) :1061-1081
[9]   Local Search Proximal Algorithms as Decision Dynamics with Costs to Move [J].
Attouch, H. ;
Soubeyran, A. .
SET-VALUED AND VARIATIONAL ANALYSIS, 2011, 19 (01) :157-177
[10]  
Attouch H, 2006, J CONVEX ANAL, V13, P207