Image de couverture de livre

Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Seccia, Ruggiero, Coppola, Corrado, Liuzzi, Giampaolo, Palagi, Laura
Format:	Preprint
Publié:	2022
Sujets:	Optimization and Control Machine Learning 90.C.XX G.4.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the local convergence of integer-valued Lipschitz functions on regular trees
par: Butler, Nathaniel, et autres
Publié: (2024)

A probabilistic representation for the gradient in a linear parabolic PDE with Neumann boundary condition
par: Madani, Abdelatif Benchérif
Publié: (2025)

CMA Light: a novel Minibatch Algorithm for large-scale non convex finite sum optimization
par: Coppola, Corrado, et autres
Publié: (2023)

An algorithm for computing syzygies on $V[X]$ when $V$ is a valuation domain
par: Lombardi, Henri, et autres
Publié: (2023)

A Path Planning Model for Intercepting a Moving Target with Finite Obstacle Avoidance
par: Akter, Masuda, et autres
Publié: (2025)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
par: Liuzzi, Giampaolo, et autres
Publié: (2025)

Strongly connected orientations and integer lattices
par: Abdi, Ahmad, et autres
Publié: (2024)

A Globally Convergent Gradient Method with Momentum
par: Lapucci, Matteo, et autres
Publié: (2024)

On Coupling Constraints in Linear Bilevel Optimization
par: Henke, Dorothee, et autres
Publié: (2024)

Beyond adaptive gradient: Fast-Controlled Minibatch Algorithm for large-scale optimization
par: Coppola, Corrado, et autres
Publié: (2024)

Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence
par: Qiu, Junwen, et autres
Publié: (2024)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
par: Cesaroni, Edoardo, et autres
Publié: (2026)

A linesearch-based derivative-free method for noisy black-box problems
par: De Santis, Alberto, et autres
Publié: (2025)

Worst case complexity bounds for linesearch-type derivative-free algorithms
par: Brilli, Andrea, et autres
Publié: (2023)

An interior point method for nonlinear constrained derivative-free optimization
par: Brilli, Andrea, et autres
Publié: (2021)

Convergence rates of S.O.S hierarchies for polynomial semidefinite programs
par: Tran, Hoang Anh, et autres
Publié: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
par: Lapucci, Matteo, et autres
Publié: (2024)

An ILP formulation to optimize flood evacuation paths by minimizing pedestrian speed, length and effort
par: Marinelli, Fabrizio, et autres
Publié: (2025)

Hidden convexity, optimization, and algorithms on rotation matrices
par: Ramachandran, Akshay, et autres
Publié: (2023)

High Probability Guarantees for Random Reshuffling
par: Yu, Hengxu, et autres
Publié: (2023)

Projected Gradient Methods with Momentum
par: Lapucci, Matteo, et autres
Publié: (2026)

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
par: Brilli, Andrea, et autres
Publié: (2024)

A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
par: Qiu, Junwen, et autres
Publié: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
par: Nishioka, Akatsuki, et autres
Publié: (2023)

Computational issues in Optimization for Deep networks
par: Coppola, Corrado, et autres
Publié: (2024)

On the convergence of computational methods for the online bin stretching problem
par: Lhomme, Antoine, et autres
Publié: (2025)

Least multivariate Chebyshev polynomials on diagonally determined sets
par: Dressler, Mareike, et autres
Publié: (2024)

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
par: Murota, Kazuo, et autres
Publié: (2025)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
par: Higuchi, Rei, et autres
Publié: (2024)

Robust Utility Maximization with Intractable Claims under Distributional Ambiguity: A Random Distributionally Robust Optimization Approach
par: Guan, Guohui, et autres
Publié: (2025)

A Linear Convergence Result for the Jacobi-Proximal Alternating Direction Method of Multipliers
par: Choi, Hyelin, et autres
Publié: (2025)

Last-iterate Convergence of ADMM on Multi-affine Quadratic Equality Constrained Problem
par: Chao, Yutong, et autres
Publié: (2026)

A Generalized Heron-Waist Problem: Optimality Conditions and Convergence Analysis
par: Choudhary, Manohar, et autres
Publié: (2026)

Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone
par: Ochiai, Hiroyuki, et autres
Publié: (2024)

Analytic Formulas for Alternating Projection Sequences for the Positive Semidefinite Cone and an Application to Convergence Analysis
par: Ochiai, Hiroyuki, et autres
Publié: (2024)

Expansions of the Characteristic Polynomial of a Perturbed Positive Semidefinite Matrix and Convergence Analysis of Alternating Projections
par: Ochiai, Hiroyuki, et autres
Publié: (2024)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
par: Latafat, Puya, et autres
Publié: (2023)

Saddle Networks: Structure-Preserving Architectures for Convex-Concave Functions
par: Warin, Xavier
Publié: (2026)

Connecting Stochastic Optimal Control and Reinforcement Learning
par: Quer, Jannes, et autres
Publié: (2022)