Cover Image

Examples of slow convergence for adaptive regularization optimization methods are not isolated

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Toint, Philippe L.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Computational Complexity 49M37, 65K05, 68Q17, 68W40, 90C30 F.2.1; G.1.6; I.1.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
by: Gratton, Serge, et al.
Published: (2024)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
by: Gratton, Serge, et al.
Published: (2026)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
by: Gratton, Serge, et al.
Published: (2024)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
by: Bellavia, S., et al.
Published: (2025)

prunAdag: an adaptive pruning-aware gradient method
by: Porcelli, Margherita, et al.
Published: (2025)

An optimally fast objective-function-free minimization algorithm using random subspaces
by: Bellavia, S., et al.
Published: (2023)

An objective-function-free algorithm for nonconvex stochastic optimization with deterministic equality and inequality constraints
by: Gratton, S., et al.
Published: (2026)

A Simple First-Order Algorithm for Full-Rank Equality Constrained Optimization
by: Gratton, Serge, et al.
Published: (2025)

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
by: Gratton, Serge, et al.
Published: (2025)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
by: Emmerich, Michael T. M., et al.
Published: (2026)

An objective-function-free algorithm for general smooth constrained optimization
by: Bellavia, S., et al.
Published: (2026)

S2MPJ and CUTEst optimization problems for Matlab, Python and Julia
by: Gratton, Serge, et al.
Published: (2024)

Completeness classes in algebraic complexity theory
by: Bürgisser, Peter
Published: (2024)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

NOVAK: Unified adaptive optimizer for deep neural networks
by: Kavun, Sergii
Published: (2026)

Adam symmetry theorem: characterization of the convergence of the stochastic Adam optimizer
by: Dereich, Steffen, et al.
Published: (2025)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
by: Emmerich, Michael T. M.
Published: (2026)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Advances in Quantum Genetic Algorithms
by: Lima, Dennis, et al.
Published: (2025)

Communication Compression for Distributed Learning without Control Variates
by: Ortega, Tomas, et al.
Published: (2024)

Communication Compression for Distributed Learning with Aggregate and Server-Guided Feedback
by: Ortega, Tomas, et al.
Published: (2025)

Quantized and Asynchronous Federated Learning
by: Ortega, Tomas, et al.
Published: (2024)

Decentralized Parameter-Free Online Learning with Compressed Gossip
by: Ortega, Tomas, et al.
Published: (2026)

Decentralized Parameter-Free Online Learning
by: Ortega, Tomas, et al.
Published: (2025)

Shifted Partial Derivative Polynomial Rank and Codimension
by: Edwards, Darren J.
Published: (2025)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
by: Koiran, Pascal, et al.
Published: (2022)

On Global and Local Convergence of Iterative Linear Quadratic Optimization Algorithms for Discrete Time Nonlinear Control
by: Roulet, Vincent, et al.
Published: (2022)

Socio-cognitive agent-oriented evolutionary algorithm with trust-based optimization
by: Urbańczyk, Aleksandra, et al.
Published: (2025)

Decentralized Optimization in Networks with Arbitrary Delays
by: Ortega, Tomas, et al.
Published: (2024)

Reliable Optimization Under Noise in Quantum Variational Algorithms
by: Novák, Vojtěch, et al.
Published: (2025)

Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method
by: Dereich, Steffen, et al.
Published: (2026)

Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes
by: Novák, Vojtěch, et al.
Published: (2025)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
by: Gratton, Serge, et al.
Published: (2024)

The Subspace Flatness Conjecture and Faster Integer Programming
by: Reis, Victor, et al.
Published: (2023)

From approximate to exact integer programming
by: Dadush, Daniel, et al.
Published: (2022)

Stochastic convergence of parallel asynchronous adaptive first-order methods
by: Gratton, Serge, et al.
Published: (2026)

Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation
by: Alpay, Faruk, et al.
Published: (2025)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
by: Ye, Lixi
Published: (2026)

Reinterpreting EMML as Mirror Descent for Constrained Maximum Likelihood Estimation
by: Clerc, Antonin, et al.
Published: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)