Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness

DOI10.1007/S10589-025-00667-YMaRDI QIDQ6969546zbMATH OpenFDO

Authors Ruggiero Seccia, Corrado Coppola, Giampaolo Liuzzi, L. Palagi

Publication date 20 June 2025

Published in Computational Optimization and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10589-025-00667-Y

zbMATH Keywords

finite-sumLipschitz smoothminibatch methodnon-monotone schemes

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26)

Cites work

• A Convergent Incremental Gradient Method with a Constant Step Size
• A Nonmonotone Line Search Technique for Newton’s Method
• A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
• A Stochastic Approximation Method
• Adaptive sampling strategies for stochastic optimization
• Adaptive subgradient methods for online learning and stochastic optimization
• Asynchronous parallel algorithms for nonconvex optimization
• Benchmarking Derivative-Free Optimization Algorithms
• Benchmarking optimization software with performance profiles.
• Convergence rate of incremental gradient and incremental Newton methods
• Deep learning
• Finite-sum smooth optimization with SARAH
• Flat Minima
• Global convergence and stabilization of unconstrained minimization methods without derivatives
• Gradient Convergence in Gradient methods with Errors
• scientific article; zbMATH DE number 3718477 (Why is no real title available?)
• scientific article; zbMATH DE number 7626722 (Why is no real title available?)
• scientific article; zbMATH DE number 7306906 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Hybrid deterministic-stochastic methods for data fitting
• Incremental gradient algorithms with stepsizes bounded away from zero
• Large-scale machine learning with stochastic gradient descent
• Minimizing finite sums with the stochastic average gradient
• Nonlinear programming
• Nonmonotone derivative-free methods for nonlinear equations
• On the convergence of a block-coordinate incremental gradient method
• On the Convergence Rate of Incremental Aggregated Gradient Algorithms
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
• Optimization methods for large-scale machine learning
• Sample size selection in optimization methods for machine learning
• Solving nonlinear inequalities in a finite number of iterations
• Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
• Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
• Stochastic Methods for Composite and Weakly Convex Optimization Problems
• Stochastic quasi-gradient methods: variance reduction via Jacobian sketching
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Understanding machine learning. From theory to algorithms
• Why random reshuffling beats stochastic gradient descent

Cited in

(1)

• Preface: new trends in large scale optimization

This page was built for publication: Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969546)