The following pages link to Benjamin Grimmer (Q266061):
Displaying 26 items.
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
- General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) (← links)
- Radial Subgradient Method (Q4606654) (← links)
- Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity (Q5231668) (← links)
- Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems (Q5231692) (← links)
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization (Q6110439) (← links)
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
- Radial duality. I: Foundations (Q6126644) (← links)
- Radial duality. II: Applications and algorithms (Q6126645) (← links)
- Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)
- On optimal universal first-order methods for minimizing heterogeneous sums (Q6191975) (← links)
- A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Order Methods (Q6298398) (← links)
- General Holder Smooth Convergence Rates Follow From Specialized Rates Assuming Growth Bounds (Q6365762) (← links)
- Accelerated Gradient Descent via Long Steps (Q6451624) (← links)
- First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points (Q6508197) (← links)
- On Averaging and Extrapolation for Gradient Descent (Q6522512) (← links)
- Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory (Q6526907) (← links)
- Accelerated Objective Gap and Gradient Norm Convergence for Gradient Descent via Long Steps (Q6526977) (← links)
- Provably faster gradient descent via long steps (Q6579999) (← links)
- A Strengthened Conjecture on the Minimax Optimal Constant Stepsize for Gradient Descent (Q6736759) (← links)
- Performance Estimation for Smooth and Strongly Convex Sets (Q6749487) (← links)
- Composing Optimized Stepsize Schedules for Gradient Descent (Q6749765) (← links)
- Beyond Minimax Optimality: A Subgame Perfect Gradient Method (Q6757272) (← links)
- Some Unified Theory for Variance Reduced Prox-Linear Methods (Q6758968) (← links)
