88 citations · 132 across the 6 of their papers we have counts for
6 papers
Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence
Julie Nutini, Issam Laradji, Mark Schmidt
Block coordinate descent (BCD) methods are widely used for large-scale numerical optimization because of their cheap iteration costs, low memory requirements, amenability to parall…
"Active-set complexity" of proximal gradient: How long does it take to find the sparsity pattern?
Julie Nutini, Mark Schmidt, Warren Hare
Proximal gradient methods have been found to be highly effective for solving minimization problems with non-negative constraints or L1-regularization. Under suitable nondegeneracy…
Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph
Julie Nutini, Behrooz Sepehry, Issam Laradji +3
The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Ve…
Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition
Hamed Karimi, Julie Nutini, Mark Schmidt
In 1963, Polyak proposed a simple condition that is sufficient to show a global linear convergence rate for gradient descent. This condition is a special case of the Łojasiewicz in…
Optimizing Damper Connectors for Adjacent Buildings
K. Bigdeli, W. Hare, J. Nutini +1
Many theoretical and experimental studies have used heuristic methods to investigate the dynamic behaviour of the passive coupling of adjacent structures. However, few papers have…
Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection
Julie Nutini, Mark Schmidt, Issam H. Laradji +2
There has been significant recent work on the theory and application of randomized coordinate descent algorithms, beginning with the work of Nesterov [SIAM J. Optim., 22(2), 2012],…