default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Grimmer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Saeed Hajizadeh
, Haihao Lu, Benjamin Grimmer:
On the Linear Convergence of Extragradient Methods for Nonconvex-Nonconcave Minimax Problems. INFORMS J. Optim. 6(1): 19-31 (2024)- [j14]Benjamin Grimmer:
Radial duality part I: foundations. Math. Program. 205(1): 33-68 (2024) - [j13]Benjamin Grimmer:
Radial duality part II: applications and algorithms. Math. Program. 205(1): 69-105 (2024) - [j12]Benjamin Grimmer:
On optimal universal first-order methods for minimizing heterogeneous sums. Optim. Lett. 18(2): 427-445 (2024) - [j11]Benjamin Grimmer:
Provably Faster Gradient Descent via Long Steps. SIAM J. Optim. 34(3): 2588-2608 (2024) - 2023
- [j10]Benjamin Grimmer:
General Hölder Smooth Convergence Rates Follow from Specialized Rates Assuming Growth Bounds. J. Optim. Theory Appl. 197(1): 51-70 (2023) - [j9]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab Mirrokni:
The landscape of the proximal point method for nonconvex-nonconcave minimax optimization. Math. Program. 201(1): 373-407 (2023) - [j8]Mateo Díaz, Benjamin Grimmer:
Optimal Convergence Rates for the Proximal Bundle Method. SIAM J. Optim. 33(2): 424-454 (2023) - [j7]Lijun Ding, Benjamin Grimmer:
Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates. SIAM J. Optim. 33(2): 1305-1332 (2023) - [i8]Ning Liu, Benjamin Grimmer:
Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets. CoRR abs/2303.05037 (2023) - [i7]Benjamin Grimmer, Danlin Li:
Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization. CoRR abs/2305.17323 (2023) - [i6]Benjamin Grimmer:
Provably Faster Gradient Descent via Long Steps. CoRR abs/2307.06324 (2023) - 2022
- [j6]James Renegar, Benjamin Grimmer:
A Simple Nearly Optimal Restart Scheme For Speeding Up First-Order Methods. Found. Comput. Math. 22(1): 211-256 (2022) - [c5]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. ALT 2022: 465-487 - 2020
- [i5]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
The Landscape of Nonconvex-Nonconcave Minimax Optimization. CoRR abs/2006.08667 (2020) - [i4]Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab S. Mirrokni:
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems. CoRR abs/2010.10628 (2020)
2010 – 2019
- 2019
- [j5]Benjamin Grimmer:
Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity. SIAM J. Optim. 29(2): 1350-1365 (2019) - [j4]Damek Davis, Benjamin Grimmer:
Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems. SIAM J. Optim. 29(3): 1908-1930 (2019) - 2018
- [j3]Benjamin Grimmer:
Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems. Algorithmica 80(10): 2849-2873 (2018) - [j2]Benjamin Grimmer:
Radial Subgradient Method. SIAM J. Optim. 28(1): 459-469 (2018) - 2017
- [c4]Praneeth Tota, Sanjiv Kapoor, Benjamin Grimmer:
Economic inefficiency in resource allocation games. Allerton 2017: 708-715 - [i3]Damek Davis, Benjamin Grimmer:
Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems. CoRR abs/1707.03505 (2017) - [i2]Benjamin Grimmer:
Convergence Rates for Deterministic and Stochastic Subgradient Methods Without Lipschitz Continuity. CoRR abs/1712.04104 (2017) - 2016
- [j1]Gruia Calinescu, Benjamin Grimmer, Satyajayant Misra, Sutep Tongngam, Guoliang Xue, Weiyi Zhang:
Improved approximation algorithms for single-tiered relay placement. J. Comb. Optim. 31(3): 1280-1297 (2016) - [c3]Benjamin Grimmer, Sanjiv Kapoor:
Nash equilibrium and the price of anarchy in priority based network routing. INFOCOM 2016: 1-9 - 2015
- [i1]Benjamin Grimmer:
Dual-Fitting Approximation Algorithms for Network Connectivity Problems. CoRR abs/1508.05567 (2015) - 2014
- [c2]Benjamin Grimmer, Kan Qiao:
Near linear time 5/3-approximation algorithms for two-level power assignment problems. FOMC 2014: 29-38 - [c1]Scott J. Krieder, Justin M. Wozniak, Timothy G. Armstrong, Michael Wilde, Daniel S. Katz, Benjamin Grimmer, Ian T. Foster, Ioan Raicu:
Design and evaluation of the gemtc framework for GPU-enabled many-task computing. HPDC 2014: 153-164
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
