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

DOI10.1007/S11228-015-0319-6zbMATH Open1342.49019OpenAlexW2067758274MaRDI QIDQ494873FDOQ494873

Authors: G. 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

Recommendations

• Inexact proximal point method for general variational inequalities
• Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
• On general inexact proximal point algorithms and their contributions to linear convergence analysis
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Inexact \(A\)-proximal point algorithm and applications to nonlinear variational inclusion problems
• scientific article
• Inexact proximal point methods for variational inequality problems
• Generalized inexact proximal point algorithm and its role to linear convergence analysis
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• A proximal point method for nonsmooth convex optimization problems in Banach spaces

zbMATH Keywords

nonconvex optimizationspeed of convergenceinexact proximal algorithmsKurdyka-Łojasiewicz inequality

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Cognitive psychology (91E10) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Nonsmooth analysis (49J52)

Cites Work

• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Geometric categories and o-minimal structures
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Learning how to play Nash, potential games and alternating minimization method for structured nonconvex problems on Riemannian manifolds
• Clarke Subgradients of Stratifiable Functions
• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• A generalized proximal point algorithm for certain non-convex minimization problems
• Monotone Operators and the Proximal Point Algorithm
• Proximité et dualité dans un espace hilbertien
• Title not available (Why is that?)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Prospect Theory: An Analysis of Decision under Risk
• Title not available (Why is that?)
• On gradients of functions definable in o-minimal structures
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Proof of the gradient conjecture of R. Thom.
• Proximal point methods and nonconvex optimization
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• A proximal algorithm with quasi distance. Application to habit's formation
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Submonotone mappings and the proximal point algorithm
• Inexact Variants of the Proximal Point Algorithm without Monotonicity
• Proximal Methods for Cohypomonotone Operators
• Pointwise convergence of gradient‐like systems
• Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
• Proximal methods in reflexive Banach spaces without monotonicity
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• 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
• Maximal elements under reference-dependent preferences with applications to behavioral traps and games
• Local search proximal algorithms as decision dynamics with costs to move

Cited In (10)

• General descent method using w-distance. Application to emergence of habits following worthwhile moves
• A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
• Local convergence of the heavy-ball method and iPiano for non-convex optimization
• A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
• Dual descent methods as tension reduction systems
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
• Coercivity and generalized proximal algorithms: application -- traveling around the world
• A proximal method for equilibrium problems under growth conditions
• A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality

This page was built for publication: A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality

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