default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOliver Hinder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Yair Carmon, Oliver Hinder:
The Price of Adaptivity in Stochastic Convex Optimization. COLT 2024: 772-774- [c11]Itai Kreisler, Maor Ivgi, Oliver Hinder, Yair Carmon:
Accelerated Parameter-Free Stochastic Optimization. COLT 2024: 3257-3324 - [i11]Yair Carmon, Oliver Hinder:
The Price of Adaptivity in Stochastic Convex Optimization. CoRR abs/2402.10898 (2024) - [i10]Itai Kreisler, Maor Ivgi, Oliver Hinder, Yair Carmon:
Accelerated Parameter-Free Stochastic Optimization. CoRR abs/2404.00666 (2024) - 2023
- [j6]David L. Applegate, Oliver Hinder
, Haihao Lu, Miles Lubin:
Faster first-order primal-dual methods for linear programming using restarts and sharpness. Math. Program. 201(1): 133-184 (2023) - [c10]Maor Ivgi, Oliver Hinder, Yair Carmon:
DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule. ICML 2023: 14465-14499 - [c9]Jungtaek Kim, Mingxuan Li, Oliver Hinder, Paul W. Leu:
Datasets and Benchmarks for Nanophotonic Structure and Parametric Design Simulations. NeurIPS 2023 - [i9]Maor Ivgi, Oliver Hinder, Yair Carmon:
DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule. CoRR abs/2302.12022 (2023) - [i8]Jungtaek Kim, Mingxuan Li, Oliver Hinder, Paul W. Leu:
Datasets and Benchmarks for Nanophotonic Structure and Parametric Design Simulations. CoRR abs/2310.19053 (2023) - 2022
- [c8]Yair Carmon, Oliver Hinder:
Making SGD Parameter-Free. COLT 2022: 2360-2389 - [c7]Fadi Hamad, Oliver Hinder:
A consistently adaptive trust-region method. NeurIPS 2022 - [i7]Yair Carmon, Oliver Hinder:
Making SGD Parameter-Free. CoRR abs/2205.02160 (2022) - [i6]Zhaonan Qu, Wenzhi Gao, Oliver Hinder, Yinyu Ye, Zhengyuan Zhou:
Optimal Diagonal Preconditioning: Theory and Practice. CoRR abs/2209.00809 (2022) - 2021
- [j5]Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford:
Lower bounds for finding stationary points II: first-order methods. Math. Program. 185(1-2): 315-355 (2021) - [j4]Gabriel Haeser, Oliver Hinder, Yinyu Ye:
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods. Math. Program. 186(1): 257-288 (2021) - [c6]David L. Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O'Donoghue, Warren Schudy:
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient. NeurIPS 2021: 20243-20257 - 2020
- [j3]Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford:
Lower bounds for finding stationary points I. Math. Program. 184(1): 71-120 (2020) - [c5]Oliver Hinder, Aaron Sidford, Nimit Sharad Sohoni:
Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond. COLT 2020: 1894-1938 - [c4]Rudy Bunel, Oliver Hinder, Srinadh Bhojanapalli, Krishnamurthy Dvijotham:
An efficient nonconvex reformulation of stagewise convex optimization problems. NeurIPS 2020 - [c3]John C. Duchi, Oliver Hinder, Andrew Naber, Yinyu Ye:
Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices. NeurIPS 2020 - [i5]Rudy Bunel, Oliver Hinder, Srinadh Bhojanapalli, Krishnamurthy Dvijotham:
An efficient nonconvex reformulation of stagewise convex optimization problems. CoRR abs/2010.14322 (2020)
2010 – 2019
- 2019
- [i4]Oliver Hinder, Aaron Sidford, Nimit Sharad Sohoni:
Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond. CoRR abs/1906.11985 (2019) - 2018
- [j2]Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford:
Accelerated Methods for NonConvex Optimization. SIAM J. Optim. 28(2): 1751-1772 (2018) - [c2]Oliver Hinder:
Cutting plane methods can be extended into nonconvex optimization. COLT 2018: 1451-1454 - [i3]Oliver Hinder:
Cutting plane methods can be extended into nonconvex optimization. CoRR abs/1805.08370 (2018) - [i2]Oliver Hinder, Yinyu Ye:
A polynomial time log barrier method for problems with nonconvex constraints. CoRR abs/1807.00404 (2018) - 2017
- [j1]Oliver Hinder, Andrew J. Mason:
A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness. Eur. J. Oper. Res. 262(2): 411-423 (2017) - [c1]Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford:
"Convex Until Proven Guilty": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions. ICML 2017: 654-663 - 2016
- [i1]Yair Carmon, John C. Duchi, Oliver Hinder, Aaron Sidford:
Accelerated Methods for Non-Convex Optimization. CoRR abs/1611.00756 (2016)
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-07-06 23:43 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:
