Image de couverture de livre

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gratton, Serge, Jerad, Sadok, Toint, Philippe L.
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 49M37, 65K05, 68Q17, 68W40, 90C30 F.2.1; G.1.6; I.1.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
par: Gratton, Serge, et autres
Publié: (2026)

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

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
par: Bellavia, S., et autres
Publié: (2025)

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

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
par: Gratton, Serge, et autres
Publié: (2025)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
par: Gratton, Serge, et autres
Publié: (2024)

An optimally fast objective-function-free minimization algorithm using random subspaces
par: Bellavia, S., et autres
Publié: (2023)

S2MPJ and CUTEst optimization problems for Matlab, Python and Julia
par: Gratton, Serge, et autres
Publié: (2024)

prunAdag: an adaptive pruning-aware gradient method
par: Porcelli, Margherita, et autres
Publié: (2025)

A Simple First-Order Algorithm for Full-Rank Equality Constrained Optimization
par: Gratton, Serge, et autres
Publié: (2025)

Complexity and performance for two classes of noise-tolerant first-order algorithms
par: Gratton, S., et autres
Publié: (2022)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
par: Kumar, Mrinal, et autres
Publié: (2018)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
par: Emmerich, Michael T. M., et autres
Publié: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
par: Cook, William, et autres
Publié: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
par: Hoang, Hung P., et autres
Publié: (2026)

An objective-function-free algorithm for nonconvex stochastic optimization with deterministic equality and inequality constraints
par: Gratton, S., et autres
Publié: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
par: Heimann, Sophia, et autres
Publié: (2025)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Design, Configuration, Implementation, and Performance of a Simple 32 Core Raspberry Pi Cluster
par: Cicirello, Vincent A.
Publié: (2017)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
par: Ryabchenko, Alexander, et autres
Publié: (2026)

Runtime Analyses of NSGA-III on Many-Objective Problems
par: Opris, Andre, et autres
Publié: (2024)

Decentralized Parameter-Free Online Learning
par: Ortega, Tomas, et autres
Publié: (2025)

Completeness classes in algebraic complexity theory
par: Bürgisser, Peter
Publié: (2024)

Advances in Quantum Genetic Algorithms
par: Lima, Dennis, et autres
Publié: (2025)

Decentralized Parameter-Free Online Learning with Compressed Gossip
par: Ortega, Tomas, et autres
Publié: (2026)

An objective-function-free algorithm for general smooth constrained optimization
par: Bellavia, S., et autres
Publié: (2026)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
par: Ye, Lixi
Publié: (2026)

The Impact of Partial Computations on the Red-Blue Pebble Game
par: Papp, Pál András, et autres
Publié: (2025)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
par: Fang, Xiaolei, et autres
Publié: (2026)

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

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
par: Böhnlein, Toni, et autres
Publié: (2024)

NeurOptimisation: The Spiking Way to Evolve
par: Cruz-Duarte, Jorge Mario, et autres
Publié: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
par: Gratton, Serge, et autres
Publié: (2026)

A Classical-Quantum Hybrid Architecture for Physics-Informed Neural Networks
par: Lantigua, Said, et autres
Publié: (2025)

Algorithms for Generating Small Random Samples
par: Cicirello, Vincent A.
Publié: (2024)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
par: Michel, Stefan
Publié: (2025)