Local search proximal algorithms as decision dynamics with costs to move

DOI10.1007/s11228-010-0139-7zbMath1209.49042OpenAlexW1968447369MaRDI QIDQ632228

Hedy Attouch, Antoine Soubeyran

Publication date: 15 March 2011

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-010-0139-7

zbMATH Keywords

frictioninertialocal optimizationlocal search algorithmsproximal algorithmsexploration processcosts-to-movedecision dynamicsworthwhile-to-move incremental process

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Numerical methods based on nonlinear programming (49M37) Cognitive psychology (91E10) Memory and learning in psychology (91E40) Measurement and performance in psychology (91E45)

Related Items

Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds, Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems, Proximal constrained optimization approach with time penalization, Maximal elements under reference-dependent preferences with applications to behavioral traps and games, Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard 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, Games and cost of change, An operator splitting method for monotone variational inequalities with a new perturbation strategy, A trust-region method for unconstrained multiobjective problems with applications in satisficing processes, Variational analysis in psychological modeling, Variational rationality, variational principles and the existence of traps in a changing environment, Solving the cost to go with time penalization using the Lagrange optimization approach, A proximal algorithm with quasi distance. Application to habit's formation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• The gradient and heavy ball with friction dynamical systems: The quasiconvex case
• Computing proximal points of nonconvex functions
• Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
• Economists' models of learning
• On the variational principle
• Survey of decision field theory
• Proximal Point Approach and Approximation of Variational Inequalities
• Constructing and exploring wells of energy landscapes
• A Parallel Splitting Method for Coupled Monotone Inclusions
• 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
• On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
• Monotone Operators and the Proximal Point Algorithm
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• Numerical Optimization
• Convergence of Proximal-Like Algorithms
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region