A Generalized Inexact Proximal Point Method for Nonsmooth Functions that Satisfies Kurdyka Lojasiewicz Inequality

被引:9
作者
Bento, G. C. [1 ]
Soubeyran, A. [2 ,3 ]
机构
[1] Univ Fed Goias, Goiania, Go, Brazil
[2] Aix Marseille Univ, CNRS, Aix Marseille Sch Econ, Marseille, France
[3] EHESS, Marseille, France
关键词
Nonconvex optimization; Kurdyka-Lojasiewicz inequality; Inexact proximal algorithms; Speed of convergence; ALGORITHM; CONVERGENCE; MINIMIZATION;
D O I
10.1007/s11228-015-0319-6
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, following the ideas presented in Attouch et al. Math. Program. Ser. A, 137: 91-129, (2013), we present an inexact version of the proximal point method for nonsmooth functions, whose regularization is given by a generalized perturbation term. More precisely, the new perturbation term is defined as a "curved enough" function of the quasi distance between two successive iterates, that appears to be a nice tool for Behavioral Sciences (Psychology, Economics, Management, Game theory, aEuro broken vertical bar ). Our convergence analysis is an extension, of the analysis due to Attouch and Bolte Math. Program. Ser. B, 116: 5-16, (2009) and, more generally, to Moreno et al. Optimization, 61:1383-1403, (2011), to an inexact setting of the proximal method which is more suitable from the point of view of applications. In a dynamic setting, (Bento and Soubeyran (2014)) present a striking application on the famous Nobel Prize (Kahneman and Tversky. Econometrica 47(2), 263-291 (1979); Tversky and Kahneman. Q. J. Econ. 106(4), 1039-1061 (38))"loss aversion effect" in Psychology and Management. This application shows how the strength of resistance to change can impact the speed of formation of a habituation/routinization process.
引用
收藏
页码:501 / 517
页数:17
相关论文
共 38 条
[1]   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
[2]   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
[3]   On the convergence of the proximal algorithm for nonsmooth functions involving analytic features [J].
Attouch, Hedy ;
Bolte, Jerome .
MATHEMATICAL PROGRAMMING, 2009, 116 (1-2) :5-16
[4]   Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods [J].
Attouch, Hedy ;
Bolte, Jerome ;
Svaiter, Benar Fux .
MATHEMATICAL PROGRAMMING, 2013, 137 (1-2) :91-129
[5]   Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality [J].
Attouch, Hedy ;
Bolte, Jerome ;
Redont, Patrick ;
Soubeyran, Antoine .
MATHEMATICS OF OPERATIONS RESEARCH, 2010, 35 (02) :438-457
[6]  
Bento C. G., 2011, ARXIV11034828
[7]   Generalized Inexact Proximal Algorithms: Routine's Formation with Resistance to Change, Following Worthwhile Changes [J].
Bento, G. C. ;
Soubeyran, A. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2015, 166 (01) :172-187
[8]  
Bento G. C., 2014, GEN INEXACT PROXIMAL
[9]   THE LOJASIEWICZ INEQUALITY FOR NONSMOOTH SUBANALYTIC FUNCTIONS WITH APPLICATIONS TO SUBGRADIENT DYNAMICAL SYSTEMS [J].
Bolte, Jerome ;
Daniilidis, Aris ;
Lewis, Adrian .
SIAM JOURNAL ON OPTIMIZATION, 2007, 17 (04) :1205-1223
[10]   Clarke subgradients of stratifiable functions [J].
Bolte, Jerome ;
Daniilidis, Aris ;
Lewis, Adrian ;
Shiota, Masahiro .
SIAM JOURNAL ON OPTIMIZATION, 2007, 18 (02) :556-572