:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Boresta, Marco, De Santis, Alberto, Lucidi, Stefano
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2506.08758
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A linesearch-based derivative-free method for noisy black-box problems
by: De Santis, Alberto, et al.
Published: (2025)

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction
by: Cristofari, Andrea, et al.
Published: (2025)

On the Role of Batch Size in Stochastic Conditional Gradient Methods
by: Islamov, Rustem, et al.
Published: (2026)

Projected Gradient Methods with Momentum
by: Lapucci, Matteo, et al.
Published: (2026)

A Globally Convergent Gradient Method with Momentum
by: Lapucci, Matteo, et al.
Published: (2024)

Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size
by: Oowada, Kanata, et al.
Published: (2025)

Computational issues in Optimization for Deep networks
by: Coppola, Corrado, et al.
Published: (2024)

Increasing Both Batch Size and Learning Rate Accelerates Stochastic Gradient Descent
by: Umeda, Hikaru, et al.
Published: (2024)

AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods
by: Lau, Tim Tsz-Kit, et al.
Published: (2024)

Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods
by: Lau, Tim Tsz-Kit, et al.
Published: (2024)

Adaptive Batch Size and Learning Rate Scheduler for Stochastic Gradient Descent Based on Minimization of Stochastic First-order Oracle Complexity
by: Umeda, Hikaru, et al.
Published: (2025)

Complexity results and active-set identification of a derivative-free method for bound-constrained problems
by: Brilli, Andrea, et al.
Published: (2024)

Boosting Accelerated Proximal Gradient Method with Adaptive Sampling for Stochastic Composite Optimization
by: Zhu, Dongxuan, et al.
Published: (2025)

Convergence of Riemannian Stochastic Gradient Descents: Varying Batch Sizes And Nonstandard Batch Forming
by: Wu, Hao
Published: (2026)

Relationship between Batch Size and Number of Steps Needed for Nonconvex Optimization of Stochastic Gradient Descent using Armijo Line Search
by: Tsukada, Yuki, et al.
Published: (2023)

Urgent Samples in Clinical Laboratories: Stochastic Batching to Minimize Patient Turnaround Time
by: Novak, Antonin, et al.
Published: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size
by: Ostroukhov, Petr, et al.
Published: (2024)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
by: Liuzzi, Giampaolo, et al.
Published: (2025)

Method with Batching for Stochastic Finite-Sum Variational Inequalities in Non-Euclidean Setting
by: Pichugin, Alexander, et al.
Published: (2024)

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
by: Pichugin, Alexander, et al.
Published: (2024)

Worst case complexity bounds for linesearch-type derivative-free algorithms
by: Brilli, Andrea, et al.
Published: (2023)

Convergence of the Iterates of the Stochastic Proximal Gradient Method
by: Madariaga, Javier I.
Published: (2026)

Universal Gradient Methods for Stochastic Convex Optimization
by: Rodomanov, Anton, et al.
Published: (2024)

Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent
by: Köhne, Frederik, et al.
Published: (2023)

Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Batched First-Order Methods for Parallel LP Solving in MIP
by: Blin, Nicolas, et al.
Published: (2026)

Stochastic Gradient Methods with Preconditioned Updates
by: Sadiev, Abdurakhmon, et al.
Published: (2022)

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
by: Pougkakiotis, Spyridon, et al.
Published: (2022)

Generalized Stochastic Gradient Descent with Momentum Methods for Smooth Optimization
by: Wang, Zimeng, et al.
Published: (2026)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
by: Rajoriya, Vaibhav, et al.
Published: (2025)

Convergence Analysis of Stochastic Accelerated Gradient Methods for Generalized Smooth Optimizations
by: Yu, Chenhao, et al.
Published: (2025)

Conditional Gradient Methods with Standard LMO for Stochastic Simple Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

An interior point method for nonlinear constrained derivative-free optimization
by: Brilli, Andrea, et al.
Published: (2021)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
by: Cesaroni, Edoardo, et al.
Published: (2026)

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
by: Yao, Yao, et al.
Published: (2023)

Tighter Analysis for Decentralized Stochastic Gradient Method: Impact of Data Homogeneity
by: Li, Qiang, et al.
Published: (2024)

Mini-Batch Stochastic Halpern Algorithm for Nonexpansive Fixed point Problems
by: Iiduka, Hideaki
Published: (2026)

Multi-Fidelity Stochastic Trust Region Method with Adaptive Sampling
by: Ha, Yunsoo, et al.
Published: (2025)