{"total":16,"rows":[{"id":"2307.06324","title":"Provably Faster Gradient Descent via Long Steps","created":"2023-07-12","cited_by_count":20,"area":null},{"id":"2204.09228","title":"Tight Last-Iterate Convergence of the Extragradient and the Optimistic Gradient Descent-Ascent Algorithm for Constrained Monotone Variational Inequalities","created":"2022-04-20","cited_by_count":19,"area":null},{"id":"2110.12347","title":"Acceleration in Distributed Optimization under Similarity","created":"2021-10-24","cited_by_count":17,"area":null},{"id":"2202.04640","title":"Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods","created":"2022-02-09","cited_by_count":15,"area":null},{"id":"2402.17722","title":"Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence","created":"2024-02-27","cited_by_count":11,"area":null},{"id":"2101.11041","title":"Complementary Composite Minimization, Small Gradients in General Norms, and Applications","created":"2021-01-26","cited_by_count":9,"area":null},{"id":"2207.04387","title":"Bregman Proximal Langevin Monte Carlo via Bregman--Moreau Envelopes","created":"2022-07-10","cited_by_count":7,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","cited_by_count":4,"area":null},{"id":"2102.04259","title":"Concentration of Non-Isotropic Random Tensors with Applications to Learning and Empirical Risk Minimization","created":"2021-02-04","cited_by_count":4,"area":null},{"id":"2107.08011","title":"Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2507.15264","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","created":"2025-07-21","cited_by_count":3,"area":null},{"id":"2606.00520","title":"In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise","created":"2026-05-30","cited_by_count":3,"area":null},{"id":"2509.06466","title":"Several Performance Bounds on Decentralized Online Optimization are Highly Conservative and Potentially Misleading","created":"2025-09-08","cited_by_count":2,"area":null},{"id":"2606.20082","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2607.27476","title":"Entropy-Smooth Convex Optimization Cannot Be Accelerated","created":"2026-07-29","cited_by_count":0,"area":null},{"id":"2608.22834","title":"Mirror descent algorithms with logarithmic barriers","created":"2026-08-24","cited_by_count":0,"area":null}],"next_cursor":null}