Local search proximal algorithms as decision dynamics with costs to move

DOI10.1007/S11228-010-0139-7MaRDI QIDQ632228zbMATH OpenOpenAlexFDO

Authors Hédy 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

inertiafrictionproximal algorithmslocal search algorithmslocal optimizationexploration processcosts-to-movedecision dynamicsworthwhile-to-move incremental process

Mathematics Subject Classification ID

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

Recommendations

• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• How good are the proximal point algorithms?
• Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
• scientific article; zbMATH DE number 1857673
• A proximal algorithm with quasi distance. Application to habit's formation

Cites work

• scientific article; zbMATH DE number 5077050 (Why is no real title available?)
• scientific article; zbMATH DE number 1082417 (Why is no real title available?)
• scientific article; zbMATH DE number 1973378 (Why is no real title available?)
• scientific article; zbMATH DE number 3398324 (Why is no real title available?)
• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• A parallel splitting method for coupled monotone inclusions
• A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions
• Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
• Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• Computing proximal points of nonconvex functions
• Constructing and exploring wells of energy landscapes
• Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
• Convergence of Proximal-Like Algorithms
• Economists' models of learning
• Inertia and reactivity in decision making as cognitive variational inequalities
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Monotone Operators and the Proximal Point Algorithm
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Numerical Optimization
• On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• On the variational principle
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal point approach and approximation of variational inequalities
• Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
• Survey of decision field theory
• 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
• The gradient and heavy ball with friction dynamical systems: The quasiconvex case

Cited in

(21)

• Solving the cost to go with time penalization using the Lagrange optimization approach
• Games and cost of change
• Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds
• Maximal elements under reference-dependent preferences with applications to behavioral traps and games
• Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• 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
• Variational rationality, variational principles and the existence of traps in a changing environment
• Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds
• Variational analysis in psychological modeling
• Inertia and reactivity in decision making as cognitive variational inequalities
• Abstract generalized epsilon-descent algorithm
• An operator splitting method for monotone variational inequalities with a new perturbation strategy
• A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
• scientific article; zbMATH DE number 2127725 (Why is no real title available?)
• A proximal algorithm with quasi distance. Application to habit's formation
• A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
• Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
• scientific article; zbMATH DE number 2087632 (Why is no real title available?)
• Proximal constrained optimization approach with time penalization

This page was built for publication: Local search proximal algorithms as decision dynamics with costs to move

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632228)