Benjamin Grimmer

Orcid: 0000-0002-7003-8448

According to our database1, Benjamin Grimmer authored at least 24 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Radial duality part II: applications and algorithms.
Math. Program., May, 2024

Radial duality part I: foundations.
Math. Program., May, 2024

On optimal universal first-order methods for minimizing heterogeneous sums.
Optim. Lett., March, 2024

On the Linear Convergence of Extragradient Methods for Nonconvex-Nonconcave Minimax Problems.
INFORMS J. Optim., January, 2024

2023
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates.
SIAM J. Optim., June, 2023

General Hölder Smooth Convergence Rates Follow from Specialized Rates Assuming Growth Bounds.
J. Optim. Theory Appl., April, 2023

Optimal Convergence Rates for the Proximal Bundle Method.
SIAM J. Optim., 2023

The landscape of the proximal point method for nonconvex-nonconcave minimax optimization.
Math. Program., 2023

Provably Faster Gradient Descent via Long Steps.
CoRR, 2023

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization.
CoRR, 2023

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets.
CoRR, 2023

2022
A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order Methods.
Found. Comput. Math., 2022

Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2020
The Landscape of Nonconvex-Nonconcave Minimax Optimization.
CoRR, 2020

2019
Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity.
SIAM J. Optim., 2019

Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems.
SIAM J. Optim., 2019

2018
Radial Subgradient Method.
SIAM J. Optim., 2018

Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems.
Algorithmica, 2018

2017
Economic inefficiency in resource allocation games.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Improved approximation algorithms for single-tiered relay placement.
J. Comb. Optim., 2016

Nash equilibrium and the price of anarchy in priority based network routing.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Dual-Fitting Approximation Algorithms for Network Connectivity Problems.
CoRR, 2015

2014
Design and evaluation of the gemtc framework for GPU-enabled many-task computing.
Proceedings of the 23rd International Symposium on High-Performance Parallel and Distributed Computing, 2014

Near linear time 5/3-approximation algorithms for two-level power assignment problems.
Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, 2014


  Loading...