Oliver Hinder
Oliver Hinder
Assistant Professor, Industrial Engineering Department, University of Pittsburgh
Verified email at pitt.edu - Homepage
Title
Cited by
Cited by
Year
Accelerated methods for nonconvex optimization
Y Carmon, JC Duchi, O Hinder, A Sidford
SIAM Journal on Optimization 28 (2), 1751-1772, 2018
2582018
Lower bounds for finding stationary points I
Y Carmon, JC Duchi, O Hinder, A Sidford
Mathematical Programming 184 (1), 71-120, 2020
1472020
“Convex Until Proven Guilty”: Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions
Y Carmon, JC Duchi, O Hinder, A Sidford
International Conference on Machine Learning, 654-663, 2017
902017
Lower bounds for finding stationary points II: first-order methods
Y Carmon, J Duchi, O Hinder, S Aaron
Mathematical Programming 185, 2021
41*2021
Near-optimal methods for minimizing star-convex functions and beyond
O Hinder, A Sidford, N Sohoni
Conference on Learning Theory, 1894-1938, 2020
302020
A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
O Hinder, A Mason
European Journal of Operations Research 262 (2), 411–423, 2017
182017
A one-phase interior point method for nonconvex optimization
O Hinder, Y Ye
arXiv preprint arXiv:1801.03072, 2018
142018
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
G Haeser, O Hinder, Y Ye
Mathematical Programming 186 (1), 257-288, 2021
92021
Lower bounds for finding stationary points II: first-order methods.
Y Carmon, JC Duchi, O Hinder, A Sidford
Mathematical Programming 185, 2021
8*2021
An efficient nonconvex reformulation of stagewise convex optimization problems
R Bunel, O Hinder, S Bhojanapalli, D Krishnamurthy
Advances in Neural Information Processing Systems 33, 2020
62020
Cutting plane methods can be extended into nonconvex optimization
O Hinder
Conference On Learning Theory, 1451-1454, 2018
62018
Worst-case iteration bounds for log barrier methods for problems with nonconvex constraints
O Hinder, Y Ye
arXiv preprint arXiv:1807.00404, 2018
6*2018
Faster First-Order Primal-Dual Methods for Linear Programming using Restarts and Sharpness
D Applegate, O Hinder, H Lu, M Lubin
arXiv preprint arXiv:2105.12715, 2021
52021
The stable matching linear program and an approximate rural hospital theorem with couples
O Hinder
Proceedings of WINE 15, 433, 2015
52015
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient
D Applegate, M Díaz, O Hinder, H Lu, M Lubin, B O'Donoghue, W Schudy
arXiv preprint arXiv:2106.04756, 2021
22021
A generic adaptive restart scheme with applications to saddle point algorithms
O Hinder, M Lubin
arXiv preprint arXiv:2006.08484, 2020
22020
Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices
JC Duchi, O Hinder, A Naber, Y Ye
Advances in Neural Information Processing Systems 33, 8308-8317, 2020
2020
Principled Algorithms for Finding Local Minima
O Hinder
PQDT-Global, 2019
2019
Lower Bounds for Finding Stationary Points of Non-Convex, Smooth High-Dimensional Functions
Y Carmon, JC Duchi, O Hinder, A Sidford
The system can't perform the operation now. Try again later.
Articles 1–19