팔로우
Oliver Hinder
Oliver Hinder
Assistant Professor, Industrial Engineering Department, University of Pittsburgh
pitt.edu의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
Accelerated methods for nonconvex optimization
Y Carmon, JC Duchi, O Hinder, A Sidford
SIAM Journal on Optimization 28 (2), 1751-1772, 2018
2672018
Lower bounds for finding stationary points I
Y Carmon, JC Duchi, O Hinder, A Sidford
Mathematical Programming 184 (1), 71-120, 2020
1712020
“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
1042017
Near-optimal methods for minimizing star-convex functions and beyond
O Hinder, A Sidford, N Sohoni
Conference on learning theory, 1894-1938, 2020
452020
Lower bounds for finding stationary points II: first-order methods
Y Carmon, JC Duchi, O Hinder, A Sidford
Mathematical Programming 185 (1), 315-355, 2021
38*2021
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
172018
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
142021
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
Advances in Neural Information Processing Systems 34, 20243-20257, 2021
92021
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
72021
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
72020
Worst-case iteration bounds for log barrier methods for problems with nonconvex constraints
O Hinder, Y Ye
arXiv preprint arXiv:1807.00404, 2018
7*2018
Cutting plane methods can be extended into nonconvex optimization
O Hinder
Conference On Learning Theory, 1451-1454, 2018
62018
The stable matching linear program and an approximate rural hospital theorem with couples
O Hinder
Proceedings of WINE 15, 433, 2015
52015
A generic adaptive restart scheme with applications to saddle point algorithms
O Hinder, M Lubin
arXiv preprint arXiv:2006.08484, 2020
22020
Making SGD Parameter-Free
Y Carmon, O Hinder
arXiv preprint arXiv:2205.02160, 2022
12022
Principled Algorithms for Finding Local Minima
O Hinder
Stanford University, 2019
12019
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
Lower Bounds for Finding Stationary Points of Non-Convex, Smooth High-Dimensional Functions
Y Carmon, JC Duchi, O Hinder, A Sidford
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–19