Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
From MaRDI portal
Publication:493265
DOI10.1007/s10957-015-0711-2zbMath1342.49018arXiv1306.2494OpenAlexW2011414908MaRDI QIDQ493265
Antoine Soubeyran, Glaydston C. Bento
Publication date: 3 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2494
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Cognitive psychology (91E10)
Related Items
Global convergence of a proximal linearized algorithm for difference of convex functions, A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem, Abstract regularized equilibria: application to Becker's household behavior theory, Coercivity and generalized proximal algorithms: application -- traveling around the world, General descent method using w-distance. Application to emergence of habits following worthwhile moves, The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality, Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems, Variational analysis in psychological modeling, Dual descent methods as tension reduction systems, A proximal point-type method for multicriteria optimization, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
Cites Work
- Unnamed Item
- Unnamed Item
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- Local search proximal algorithms as decision dynamics with costs to move
- Inexact proximal point methods in metric spaces
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- Decision making and optimization in changeable spaces, a new paradigm
- Maximal elements under reference-dependent preferences with applications to behavioral traps and games
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- KNOWLEDGE ACCUMULATION WITHIN AN ORGANIZATION
- A proximal algorithm with quasi distance. Application to habit's formation
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- Monotone Operators and the Proximal Point Algorithm
- Prospect Theory: An Analysis of Decision under Risk
- Variational Analysis
- Proximité et dualité dans un espace hilbertien
