A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
From MaRDI portal
(Redirected from Publication:494873)
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; zbMATH DE number 6099634
- 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
Cites work
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- A generalized proximal point algorithm for certain non-convex minimization problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A proximal algorithm with quasi distance. Application to habit's formation
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Clarke Subgradients of Stratifiable Functions
- 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
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- Geometric categories and o-minimal structures
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Learning how to play Nash, potential games and alternating minimization method for structured nonconvex problems on Riemannian manifolds
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Local search proximal algorithms as decision dynamics with costs to move
- Maximal elements under reference-dependent preferences with applications to behavioral traps and games
- Monotone Operators and the Proximal Point Algorithm
- On gradients of functions definable in o-minimal structures
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Pointwise convergence of gradient‐like systems
- Proof of the gradient conjecture of R. Thom.
- Prospect Theory: An Analysis of Decision under Risk
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal Methods for Cohypomonotone Operators
- Proximal methods in reflexive Banach spaces without monotonicity
- Proximal point methods and nonconvex optimization
- Proximité et dualité dans un espace hilbertien
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Submonotone mappings and the proximal point algorithm
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Cited in
(10)- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- 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
- 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
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Dual descent methods as tension reduction systems
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Coercivity and generalized proximal algorithms: application -- traveling around the world
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)
