A proximal algorithm with quasi distance. Application to habit's formation
Publication:3145052
DOI10.1080/02331934.2011.564623zbMath1267.65064OpenAlexW1987964049MaRDI QIDQ3145052
Antoine Soubeyran, Felipe García Moreno, Paulo Roberto Oliveira
Publication date: 13 December 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.564623
minimization probleminertiavariational analysisproximal methodKurdyka-Łojasiewicz inequalityquasi distancecosts to changeanchoring effectdecision making sciencesformation of habit
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Management decision making, including multiple objectives (90B50)
Related Items (17)
Cites Work
- Local search proximal algorithms as decision dynamics with costs to move
- Compactness and finite dimension in asymmetric normed linear spaces
- Existence of solutions in variational relation problems without convexity
- Partial quasi-metrics
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- Proximal point methods and nonconvex optimization
- Applications of utility functions defined on quasi-metric spaces
- Recursive quasi-metric spaces.
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Monotone Operators and the Proximal Point Algorithm
- Prospect Theory: An Analysis of Decision under Risk
- Variational Analysis
- Proximal Minimization Methods with Generalized Bregman Functions
- Nonsmooth sequential analysis in Asplund spaces
- Quasi-metric spaces and point-free geometry
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
This page was built for publication: A proximal algorithm with quasi distance. Application to habit's formation