| Accelerated methods for nonconvex optimization Y Carmon, JC Duchi, O Hinder, A Sidford SIAM Journal on Optimization 28 (2), 1751-1772, 2018 | 306 | 2018 |
| Lower bounds for finding stationary points I Y Carmon, JC Duchi, O Hinder, A Sidford Mathematical Programming 184 (1-2), 71-120, 2020 | 246 | 2020 |
| “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 | 135 | 2017 |
| Near-optimal methods for minimizing star-convex functions and beyond O Hinder, A Sidford, N Sohoni Conference on learning theory, 1894-1938, 2020 | 72 | 2020 |
| Lower bounds for finding stationary points ii: first-order methods Y Carmon, JC Duchi, O Hinder, A Sidford Mathematical Programming 185 (1-2), 315-355, 2021 | 47 | 2021 |
| 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 | 35 | 2021 |
| A one-phase interior point method for nonconvex optimization O Hinder, Y Ye arXiv preprint arXiv:1801.03072, 2018 | 22 | 2018 |
| Faster first-order primal-dual methods for linear programming using restarts and sharpness D Applegate, O Hinder, H Lu, M Lubin Mathematical Programming 201 (1-2), 133-184, 2023 | 20 | 2023 |
| 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 | 19 | 2017 |
| On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods G Haeser, O Hinder, Y Ye Mathematical Programming 186 (1-2), 257-288, 2021 | 17 | 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 | 12 | 2020 |
| Worst-case iteration bounds for log barrier methods for problems with nonconvex constraints O Hinder, Y Ye arXiv preprint arXiv:1807.00404, 2018 | 12* | 2018 |
| Cutting plane methods can be extended into nonconvex optimization O Hinder Conference On Learning Theory, 1451-1454, 2018 | 10 | 2018 |
| Making SGD Parameter-Free Y Carmon, O Hinder Conference on Learning Theory, 2360-2389, 2022 | 9 | 2022 |
| The stable matching linear program and an approximate rural hospital theorem with couples O Hinder Proceedings of WINE 15, 433, 2015 | 4 | 2015 |
| DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule M Ivgi, O Hinder, Y Carmon arXiv preprint arXiv:2302.12022, 2023 | 3 | 2023 |
| Optimal Diagonal Preconditioning Z Qu, W Gao, O Hinder, Y Ye, Z Zhou arXiv preprint arXiv:2209.00809, 2022 | 2 | 2022 |
| A generic adaptive restart scheme with applications to saddle point algorithms O Hinder, M Lubin arXiv preprint arXiv:2006.08484, 2020 | 2 | 2020 |
| 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 | 2 | 2020 |
| Principled Algorithms for Finding Local Minima O Hinder Stanford University, 2019 | 1 | 2019 |
Yair CarmonTel Aviv UniversityVerified email at tauex.tau.ac.il
