Linesearch-free adaptive Bregman proximal gradient for convex minimization under local relative smoothness
math.OC
Submitted: 2025-08-02
Updated: 2026-06-05
Code: https://github.com/pylat/adaptive-proximal-algorithms
Terminology
Sources
- Stochastic Adaptive Gradient Descent Without Descent
- Approximate Bregman proximal gradient algorithm with variable metric Armijo line search
- ALiA: Adaptive Linearized ADMM
- Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates
- Entropic Mirror Descent for Linear Systems: Polyak's Stepsize and Implicit Bias
- An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization
- Simple linesearch-free first-order methods for nonconvex optimization
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise