Cover Image

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gratton, Serge, Jerad, Sadok, Toint, Philippe L.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C60, 90C30, 90C15, 90C26, 49N30 F.2.1; G.1.6
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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)

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

On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)

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

Pseudoconvex Problems in Operational Decision Systems: Algorithms for Joint Learning and Optimization
by: Li, Zijun, et al.
Published: (2026)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
by: Alcantara, Jan Harold, et al.
Published: (2024)

A first-order method for nonconvex-strongly-concave constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

Exploiting cone approximations in an augmented Lagrangian method for conic optimization
by: Fukuda, Mituhiro, et al.
Published: (2024)

A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
by: Lu, Zhaosong, et al.
Published: (2025)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
by: Yao, Tongliang, et al.
Published: (2024)

Level Constrained First Order Methods for Function Constrained Optimization
by: Boob, Digvijay, et al.
Published: (2022)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

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

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)

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

On Computing and Pricing of Adjustable Robust Chemical Process Designs
by: Schwientek, Jan, et al.
Published: (2025)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
Published: (2025)

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
by: Fu, Wenhao, et al.
Published: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
by: Lu, Zhaosong, et al.
Published: (2024)

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

A heavy-ball type curve search method for smooth convexly constrained optimization
by: Donnini, Federica, et al.
Published: (2026)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
by: Higuchi, Rei, et al.
Published: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
by: Cecere, Francesco, et al.
Published: (2025)

A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm
by: Rando, Marco, et al.
Published: (2025)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
by: He, Chuan, et al.
Published: (2023)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
by: Kong, Weiwei
Published: (2022)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
by: Mashkoorzadeh, Feryal, et al.
Published: (2026)

Finding directional stationary points of DC programs
by: Thi, Hoai An Le, et al.
Published: (2026)

A first-order augmented Lagrangian method for constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2023)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
by: Scheinberg, Katya, et al.
Published: (2023)

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

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
by: Göß, Adrian
Published: (2026)