1 citations · 1 across the 1 of their papers we have counts for
5 papers
Conjugate Gradients and Accelerated Methods Unified: The Approximate Duality Gap View
Jelena Diakonikolas, Lorenzo Orecchia
This note provides a novel, simple analysis of the method of conjugate gradients for the minimization of convex quadratic functions. In contrast with standard arguments, our proof…
Fair Packing and Covering on a Relative Scale
Jelena Diakonikolas, Maryam Fazel, Lorenzo Orecchia
Fair resource allocation is a fundamental optimization problem with applications in operations research, networking, and economic and game theory. Research in these areas has led t…
On Acceleration with Noise-Corrupted Gradients
Michael B. Cohen, Jelena Diakonikolas, Lorenzo Orecchia
Accelerated algorithms have broad applications in large-scale optimization, due to their generality and fast convergence. However, their stability in the practical setting of noise…
Alternating Randomized Block Coordinate Descent
Jelena Diakonikolas, Lorenzo Orecchia
Block-coordinate descent algorithms and alternating minimization methods are fundamental optimization algorithms and an important primitive in large-scale optimization and machine…
Solving Packing and Covering LPs in Distributed Iterations with a Single Algorithm and Simpler Analysis
Jelena Diakonikolas, Lorenzo Orecchia
Packing and covering linear programs belong to the narrow class of linear programs that are efficiently solvable in parallel and distributed models of computation, yet are a powerf…