Benjamin Grimmer

From MaRDI portal
Person:266061

Available identifiers

zbMath Open grimmer.benjaminMaRDI QIDQ266061

List of research outcomes

PublicationDate of PublicationType
Radial duality. I: Foundations2024-04-09Paper
Radial duality. II: Applications and algorithms2024-04-09Paper
On optimal universal first-order methods for minimizing heterogeneous sums2024-03-11Paper
Goldstein Stationarity in Lipschitz Constrained Optimization2023-10-05Paper
Accelerated Gradient Descent via Long Steps2023-09-18Paper
The landscape of the proximal point method for nonconvex-nonconcave minimax optimization2023-08-01Paper
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates2023-07-12Paper
Optimal Convergence Rates for the Proximal Bundle Method2023-06-07Paper
General Hölder smooth convergence rates follow from specialized rates assuming growth bounds2023-04-17Paper
A simple nearly optimal restart scheme for speeding up first-order methods2023-04-14Paper
On the Linear Convergence of Extra-Gradient Methods for Nonconvex-Nonconcave Minimax Problems2022-01-16Paper
General Holder Smooth Convergence Rates Follow From Specialized Rates Assuming Growth Bounds2021-04-20Paper
Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity2019-08-27Paper
Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems2019-08-27Paper
General Convergence Rates Follow From Specialized Rates Assuming Growth Bounds2019-05-15Paper
Dual-based approximation algorithms for cut-based network connectivity problems2018-07-26Paper
Radial Subgradient Method2018-03-09Paper
A Simple Nearly-Optimal Restart Scheme For Speeding-Up First Order Methods2018-02-28Paper
Improved approximation algorithms for single-tiered relay placement2016-04-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Benjamin Grimmer