| Accelerated methods for nonconvex optimization Y Carmon, JC Duchi, O Hinder, A Sidford SIAM Journal on Optimization 28 (2), 1751-1772, 2018 | 345 | 2018 |
| Lower bounds for finding stationary points I Y Carmon, JC Duchi, O Hinder, A Sidford Mathematical Programming 184 (1), 71-120, 2020 | 309 | 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 | 166 | 2017 |
| Near-optimal methods for minimizing star-convex functions and beyond O Hinder, A Sidford, N Sohoni Conference on learning theory, 1894-1938, 2020 | 80 | 2020 |
| 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 | 70 | 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 | 66 | 2021 |
| 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), 133-184, 2023 | 44 | 2023 |
| DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule M Ivgi, O Hinder, Y Carmon International Conference on Machine Learning, 2023 | 39 | 2023 |
| Making SGD Parameter-Free Y Carmon, O Hinder Conference on Learning Theory, 2360-2389, 2022 | 35 | 2022 |
| 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 | 22 | 2021 |
| A one-phase interior point method for nonconvex optimization O Hinder, Y Ye arXiv preprint arXiv:1801.03072, 2018 | 22 | 2018 |
| 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 | 22 | 2017 |
| 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 | 17 | 2020 |
| Worst-case iteration bounds for log barrier methods on problems with nonconvex constraints O Hinder, Y Ye Mathematics of Operations Research, 2023 | 13* | 2023 |
| Cutting plane methods can be extended into nonconvex optimization O Hinder Conference On Learning Theory, 1451-1454, 2018 | 12 | 2018 |
| Optimal Diagonal Preconditioning Z Qu, W Gao, O Hinder, Y Ye, Z Zhou Operations Research, 2024 | 8 | 2024 |
| Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs O Hinder arXiv preprint arXiv:2309.03988, 2023 | 6 | 2023 |
| The price of adaptivity in stochastic convex optimization Y Carmon, O Hinder arXiv preprint arXiv:2402.10898, 2024 | 4 | 2024 |
| Multi-BOWS: multi-fidelity multi-objective Bayesian optimization with warm starts for nanophotonic structure design J Kim, M Li, Y Li, A Gómez, O Hinder, PW Leu Digital Discovery 3 (2), 381-391, 2024 | 4 | 2024 |
| The stable matching linear program and an approximate rural hospital theorem with couples O Hinder Proceedings of WINE 15, 433, 2015 | 4 | 2015 |
Yair CarmonTel Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
