Image de couverture de livre

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jin, Ruinan, Wang, Xiaoyu, Wang, Baoxiang
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Machine Learning 65K05, 90C06, 90C26, 90C30
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
par: Jin, Ruinan, et autres
Publié: (2026)

On the convergence of proximal gradient methods for convex simple bilevel optimization
par: Latafat, Puya, et autres
Publié: (2023)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
par: Ghaffari-Hadigheh, Alireza, et autres
Publié: (2022)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
par: Gfrerer, H.
Publié: (2024)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
par: De Marchi, Alberto
Publié: (2024)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
par: Okamura, Kaito, et autres
Publié: (2024)

A non-monotone trust-region method with noisy oracles and additional sampling
par: Krejic, Natasa, et autres
Publié: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
par: Latafat, Puya, et autres
Publié: (2023)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
par: Gratton, S., et autres
Publié: (2026)

Hybrid optimal control with mixed-integer Lagrangian methods
par: Nikitina, Viktoriya, et autres
Publié: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
par: Deng, Kangkang, et autres
Publié: (2025)

Mixed-integer linearity in nonlinear optimization: a trust region approach
par: De Marchi, Alberto
Publié: (2023)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
par: Dolgopolik, M. V.
Publié: (2021)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
par: Zeng, Hanfeng, et autres
Publié: (2026)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
par: Zhou, Junpeng, et autres
Publié: (2025)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
par: Marumo, Naoki, et autres
Publié: (2023)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
par: László, Szilárd Csaba
Publié: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
par: Wang, Jia, et autres
Publié: (2025)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
par: Dahl, Simeon vom, et autres
Publié: (2026)

Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems
par: Lapucci, Matteo, et autres
Publié: (2024)

Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models
par: Lapucci, Matteo, et autres
Publié: (2024)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
par: Latafat, Puya, et autres
Publié: (2023)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
par: Ou, Hongjia, et autres
Publié: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
par: Fest, Jean-Baptiste, et autres
Publié: (2023)

Variational Properties of Decomposable Functions. Part I: Strict Epi-Calculus and Applications
par: Ouyang, Wenqing, et autres
Publié: (2023)

Variational Properties of Decomposable Functions. Part II: Strong Second-Order Theory
par: Ouyang, Wenqing, et autres
Publié: (2023)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
par: Brosch, Daniel, et autres
Publié: (2025)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
par: Monteiro, Renato D. C., et autres
Publié: (2024)

Forward-Backward algorithms for weakly convex problems
par: Bednarczuk, Ewa, et autres
Publié: (2023)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
par: Sujanani, Arnesh, et autres
Publié: (2024)