Cover Image

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bellavia, S., Gratton, S., Morini, B., Toint, Ph. L.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 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

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
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)

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)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
by: Toint, Philippe L.
Published: (2024)

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

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

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

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)

prunAdag: an adaptive pruning-aware gradient method
by: Porcelli, Margherita, 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)

Advances in Quantum Genetic Algorithms
by: Lima, Dennis, 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)

Complexity and performance for two classes of noise-tolerant first-order algorithms
by: Gratton, S., et al.
Published: (2022)

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

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

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

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., 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)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

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)

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

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

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
by: Ryabchenko, Alexander, et al.
Published: (2026)

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

Data-Adaptive Low-Rank Sparse Subspace Clustering
by: Kopriva, Ivica
Published: (2025)

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

An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
by: Anagnostopoulos, Theodoros, et al.
Published: (2026)

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

NeurOptimisation: The Spiking Way to Evolve
by: Cruz-Duarte, Jorge Mario, et al.
Published: (2025)

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