J. Nutini

发表

Ju n 20 18 Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Condition

Mark W. Schmidt, H. Karimi, J. Nutini, 2018 .

Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition

Mark W. Schmidt, Hamed Karimi, Julie Nutini, 2016, ECML/PKDD.

Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection pdf

Mark W. Schmidt, Michael P. Friedlander, Issam H. Laradji, 2015, ICML.

Let's Make Block Coordinate Descent Go Fast: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence

Mark W. Schmidt, Issam H. Laradji, J. Nutini, 2017 .

Let's Make Block Coordinate Descent Go Fast: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence

Mark W. Schmidt, Issam H. Laradji, J. Nutini, 2017, 1712.08859.

Graphical Newton for Huge-Block Coordinate Descent on Sparse Graphs

Issam H. Laradji, J. Nutini, 2017 .

Manifold identification of gradient-related proximal methods : Appendix

Mark W. Schmidt, J. Nutini, Yifan Sun, 2019 .

Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence

Mark W. Schmidt, Issam H. Laradji, J. Nutini, 2017, 1712.08859.

Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence

Mark W. Schmidt, Issam H. Laradji, J. Nutini, 2017, 1712.08859.

Proficiency Exam : Putting the curvature back into sparse solvers

J. Nutini, 2015 .

Optimizing damper connectors for adjacent buildings

J. Nutini, S. Tesfamariam, K. Bigdeli, 2015, Optimization and Engineering.

A derivative-free approximate gradient sampling algorithm for finite minimax problems

J. Nutini, W. Hare, 2013, Computational Optimization and Applications.

“Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern?

J. Nutini, W. Hare, Mark Schmidt, 2018, Optimization Letters.

Greed is good : greedy optimization methods for large-scale structured problems

Julie Nutini, J. Nutini, 2018 .

Optimizing damper connectors for adjacent buildings

W. Hare, K. Bigdeli, J. Nutini, 2015, 1511.02182.

A survey of non-gradient optimization methods in structural engineering

Solomon Tesfamariam, Warren Hare, Julie Nutini, 2013, Adv. Eng. Softw..

“Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern?

Mark W. Schmidt, Warren Hare, Julie Nutini, 2017, Optim. Lett..

Are we there yet? Manifold identification of gradient-related proximal methods

Mark W. Schmidt, Yifan Sun, Julie Nutini, 2019, AISTATS.

Greed is good : greedy optimization methods for large-scale structured problems

J. Nutini, 2018 .

Convergence Rates for Greedy Kaczmarz Algorithms, and Randomized Kaczmarz Rules Using the Orthogonality Graph pdf

Mark W. Schmidt, Issam H. Laradji, Julie Nutini, 2016, UAI.

A derivative-free approximate gradient sampling algorithm for finite minimax problems

Warren Hare, Julie Nutini, J. Nutini, 2013, Comput. Optim. Appl..

Convergence Rates for Greedy Kaczmarz Algorithms, and Randomized Kaczmarz Rules Using the Orthogonality Graph

Mark W. Schmidt, J. Nutini, H. Koepke, 2016, UAI.

Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph: Appendix

Mark W. Schmidt, J. Nutini, H. Koepke, 2015 .