A proximal algorithm with quasi distance. Application to habit's formation
From MaRDI portal
Publication:3145052
DOI10.1080/02331934.2011.564623zbMath1267.65064MaRDI 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 problem; inertia; variational analysis; proximal method; Kurdyka-Łojasiewicz inequality; quasi distance; costs to change; anchoring effect; decision making sciences; formation of habit
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
90B50: Management decision making, including multiple objectives
Related Items
The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, Proximal constrained optimization approach with time penalization, General descent method using w-distance. Application to emergence of habits following worthwhile moves, Coercivity and generalized proximal algorithms: application -- traveling around the world, A new approach to the proximal point method: convergence on general Riemannian manifolds, Proximal point method on Finslerian manifolds and the ``effort-accuracy trade-off, Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes, A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality, A proximal point algorithm with quasi-distance in multi-objective optimization, Dual descent methods as tension reduction systems, Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases, Solving the cost to go with time penalization using the Lagrange optimization approach, An improved proximal method with quasi-distance for nonconvex multiobjective optimization problem, A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem, Variational analysis in psychological modeling, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
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
