| Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition H Karimi, J Nutini, M Schmidt Joint European conference on machine learning and knowledge discovery in …, 2016 | 1432 | 2016 |
| Coordinate descent converges faster with the gauss-southwell rule than random selection J Nutini, M Schmidt, I Laradji, M Friedlander, H Koepke International Conference on Machine Learning, 1632-1641, 2015 | 276 | 2015 |
| A survey of non-gradient optimization methods in structural engineering W Hare, J Nutini, S Tesfamariam Advances in Engineering Software 59, 19-28, 2013 | 235 | 2013 |
| Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence J Nutini, I Laradji, M Schmidt arXiv preprint arXiv:1712.08859, 2017 | 97* | 2017 |
| Convergence rates for greedy Kaczmarz algorithms, and faster randomized Kaczmarz rules using the orthogonality graph J Nutini, B Sepehry, I Laradji, M Schmidt, H Koepke, A Virani arXiv preprint arXiv:1612.07838, 2016 | 69 | 2016 |
| A derivative-free approximate gradient sampling algorithm for finite minimax problems W Hare, J Nutini Computational Optimization and Applications 56, 1-38, 2013 | 62 | 2013 |
| “Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern? J Nutini, M Schmidt, W Hare Optimization Letters 13, 645-655, 2019 | 48 | 2019 |
| Are we there yet? manifold identification of gradient-related proximal methods Y Sun, H Jeong, J Nutini, M Schmidt The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 40 | 2019 |
| Optimizing damper connectors for adjacent buildings K Bigdeli, W Hare, J Nutini, S Tesfamariam Optimization and Engineering 17 (1), 47-75, 2016 | 32 | 2016 |
| Convergence rates for greedy Kaczmarz algorithms J Nutini, B Sepehry, A Virani, I Laradji, M Schmidt, H Koepke Conference on Uncertainty in Artificial Intelligence, 2016 | 18 | 2016 |
| Greed is good: greedy optimization methods for large-scale structured problems J Nutini University of British Columbia, 2018 | 16 | 2018 |
| Optimal design of damper connectors for adjacent buildings K Bigdeli, W Hare, J Nutini, S Tesfamariam Comput Struct, submitted for publication, 2013 | 2 | 2013 |
| Convergence rates for greedy Kaczmarz algorithms, and faster randomized Kaczmarz rules using the orthogonality graph J Nutini, M Schmidt, B Sepehry, H Koepke, I Laradji, A Virani J. Fourier Anal. Appl 15 (2), 262-278, 2009 | 2 | 2009 |
| Putting the curvature back into sparse solvers J Nutini | | 2013 |
| A Derivative-Free Approximate Gradient Sampling Algorithm for Finite Minimax Problems JA Nutini University of British Columbia, 2012 | | 2012 |
| “Active-set complexity” of proximal gradient J Nutini, M Schmidt, W Hare | | |
| Graphical Newton for Huge-Block Coordinate Descent on Sparse Graphs I Laradji, J Nutini, M Schmidt | | |
| A Comparison of Random Forests and Dropout Nets for Sign Language Recognition with the Kinect N Jaques, J Nutini | | |
