A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality

DOI10.1007/s11228-015-0319-6zbMath1342.49019OpenAlexW2067758274MaRDI QIDQ494873

Glaydston C. Bento, Antoine Soubeyran

Publication date: 2 September 2015

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

Full work available at URL: https://doi.org/10.1007/s11228-015-0319-6

zbMATH Keywords

nonconvex optimizationKurdyka-Łojasiewicz inequalityspeed of convergenceinexact proximal algorithms

Mathematics Subject Classification ID

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

Local convergence of the heavy-ball method and iPiano for non-convex optimization, 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, A proximal method for equilibrium problems under growth conditions, Coercivity and generalized proximal algorithms: application -- traveling around the world, General descent method using w-distance. Application to emergence of habits following worthwhile moves, 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, Dual descent methods as tension reduction systems, 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
• Unnamed Item
• 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
• Local search proximal algorithms as decision dynamics with costs to move
• Proximal methods in reflexive Banach spaces without monotonicity
• 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
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Geometric categories and o-minimal structures
• 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
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• 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
• Clarke Subgradients of Stratifiable Functions
• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• A generalized proximal point algorithm for certain non-convex minimization problems
• Submonotone mappings and the proximal point algorithm
• Monotone Operators and the Proximal Point Algorithm
• Prospect Theory: An Analysis of Decision under Risk
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Proximal Methods for Cohypomonotone Operators
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Pointwise convergence of gradient‐like systems
• Proximité et dualité dans un espace hilbertien
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Proof of the gradient conjecture of R. Thom.