Cover Image

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gratton, Serge, Kopaničáková, Alena, Toint, Philippe
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Artificial Intelligence Numerical Analysis 49K20, 65M55, 65Y20, 68Q25, 68T05, 90C26, 90C30 F.2.1; G.1.8; I.2.5
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Gradient Methods with Memory for Minimizing Composite Functions
by: Florea, Mihai I.
Published: (2022)

Dimension-free estimators of gradients of functions with(out) non-independent variables
by: Lamboni, Matieyendou
Published: (2025)

A template for gradient norm minimization
by: Florea, Mihai I.
Published: (2024)

An optimal lower bound for smooth convex functions
by: Florea, Mihai I., et al.
Published: (2024)

Adaptive first-order methods with enhanced worst-case rates
by: Florea, Mihai I.
Published: (2024)

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
by: Chen, Kaihuang, et al.
Published: (2025)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

Accelerated primal dual fixed point algorithm
by: Zhu, Ya-Nan
Published: (2025)

Minimal enclosing balls via geodesics
by: Goodwin, Ariel, et al.
Published: (2026)

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

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, et al.
Published: (2025)

HPR-LP: An implementation of an HPR method for solving linear programming
by: Chen, Kaihuang, et al.
Published: (2024)

Acceleration and restart for the randomized Bregman-Kaczmarz method
by: Tondji, Lionel, et al.
Published: (2023)

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)

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

Geometry-dependent matching pursuit: a transition phase for convergence on linear regression and LASSO
by: Moucer, Céline, et al.
Published: (2024)

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

Relaxed Weak Accelerated Proximal Gradient Method: a Unified Framework for Nesterov's Accelerations
by: Li, Hongda, et al.
Published: (2025)

Sharp higher order convergence rates for the Adam optimizer
by: Dereich, Steffen, et al.
Published: (2025)

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

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

On the convergence of an inertial proximal algorithm with a Tikhonov regularization term
by: László, Szilárd Csaba
Published: (2023)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

ML-Based Optimum Number of CUDA Streams for the GPU Implementation of the Tridiagonal Partition Method
by: Veneva, Milena, et al.
Published: (2025)

ML-Based Optimum Sub-system Size Heuristic for the GPU Implementation of the Tridiagonal Partition Method
by: Veneva, Milena
Published: (2025)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
by: Tondji, Lionel, et al.
Published: (2025)

Symplectic Discretization Approach for Developing New Proximal Point Algorithm
by: Yuan, Ya-xiang, et al.
Published: (2023)

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
by: Ras, Charl, et al.
Published: (2024)

Robustness, Cost, and Attack-Surface Concentration in Phishing Detection
by: Allagan, Julian, et al.
Published: (2026)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
by: Bauschke, Heinz H., et al.
Published: (2025)

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

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

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)

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

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

OPM, a collection of Optimization Problems in Matlab
by: Gratton, Serge, et al.
Published: (2021)

Stress-Testing Neural Network Verifiers with Provably Robust Instances
by: Troxell, David, et al.
Published: (2026)