Imagen de Portada

Convergence of Descent Optimization Algorithms under Polyak-Łojasiewicz-Kurdyka Conditions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bento, G. C., Mordukhovich, B. S., Mota, T. S., Nesterov, Yu.
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 65K05, 65K10, 90C26, 47N10
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
por: Ferreira, Orizon P., et al.
Publicado: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
por: Zhou, Juan, et al.
Publicado: (2024)

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
por: Qian, Yitian, et al.
Publicado: (2025)

Heavy-ball dynamics with Hessian-driven damping for non-convex optimization under the Łojasiewicz condition
por: Apidopoulos, Vassilis, et al.
Publicado: (2025)

Implicit augmented Lagrangian and generalized optimization
por: De Marchi, Alberto
Publicado: (2023)

Forward-backward algorithms devised by graphs
por: Aragón-Artacho, Francisco J., et al.
Publicado: (2024)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
por: Qian, Yitian, et al.
Publicado: (2024)

Krasnoselskii-Mann Iterations: Inertia, Perturbations and Approximation
por: Cortild, Daniel, et al.
Publicado: (2024)

Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance
por: Cortild, Daniel, et al.
Publicado: (2026)

Splitting the Forward-Backward Algorithm: A Full Characterization
por: Åkerman, Anton, et al.
Publicado: (2025)

On existence of solutions to non-convex minimization problems
por: Rele, Rohan, et al.
Publicado: (2024)

Quadratic Convergence of a Projection Method for a Plane Curve Feasibility Problem
por: Collard, Jordan, et al.
Publicado: (2025)

Accelerating Diagonal Methods for Bilevel Optimization: Unified Convergence via Continuous-Time Dynamics
por: Boţ, Radu Ioan, et al.
Publicado: (2025)

On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
por: Song, Mengmeng, et al.
Publicado: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
por: Marumo, Naoki
Publicado: (2025)

Fast Optimistic Gradient Descent Ascent (OGDA) method in continuous and discrete time
por: Bot, Radu Ioan, et al.
Publicado: (2022)

On the role of semismoothness in nonsmooth numerical analysis: Theory
por: Gfrerer, H., et al.
Publicado: (2024)

On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
por: Gfrerer, Helmut, et al.
Publicado: (2024)

Splitting the Conditional Gradient Algorithm
por: Woodstock, Zev, et al.
Publicado: (2023)

Tikhonov regularization of monotone operator flows not only ensures strong convergence of the trajectories but also speeds up the vanishing of the residuals
por: Bot, Radu Ioan, et al.
Publicado: (2024)

Inertial Methods with Viscous and Hessian driven Damping for Non-Convex Optimization
por: Maulen-Soto, Rodrigo, et al.
Publicado: (2024)

Graph splitting methods: Fixed points and strong convergence for linear subspaces
por: Aragón-Artacho, Francisco J., et al.
Publicado: (2025)

A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
por: Lu, Zhaosong, et al.
Publicado: (2025)

Discovering new phases via computing second-order stationary states of Landau-Brazovskii model
por: Bao, Chenglong, et al.
Publicado: (2026)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
por: Deng, Kangkang, et al.
Publicado: (2025)

Strong Global Convergence of the Consensus-Based Optimization Algorithm
por: Bonandin, Sabrina, et al.
Publicado: (2025)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
por: Atenas, Felipe
Publicado: (2025)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
por: Atenas, Felipe
Publicado: (2023)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
por: Gebken, Bennet
Publicado: (2025)

Extra-Gradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay
por: Boţ, Radu Ioan, et al.
Publicado: (2024)

Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima
por: Dixit, Rishabh, et al.
Publicado: (2023)

Adaptive Preconditioned Gradient Descent with Energy
por: Liu, Hailiang, et al.
Publicado: (2023)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
por: Fest, Jean-Baptiste, et al.
Publicado: (2023)

Mini-Batch Stochastic Krasnosel'ski\uı-Mann Algorithm for Nonexpansive Fixed Point Problems
por: Iiduka, Hideaki
Publicado: (2026)

Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
por: Artacho, F. J. Aragón, et al.
Publicado: (2018)

Accelerated Natural Gradient Method for Parametric Manifold Optimization
por: Li, Chenyi, et al.
Publicado: (2025)

Symplectic Extra-gradient Type Method for Solving General Non-monotone Inclusion Problem
por: Yuan, Ya-xiang, et al.
Publicado: (2024)

Linear Convergence of Resolvent Splitting with Minimal Lifting and its Application to a Primal-Dual Algorithm
por: Simi, Farhana A., et al.
Publicado: (2024)

Understanding FISTA's weak convergence: A step-by-step introduction to the 2025 milestone
por: Bauschke, Heinz H., et al.
Publicado: (2026)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
por: Engquist, Björn, et al.
Publicado: (2022)