106 citations · 247 across the 34 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
math.OC2008★ 19 cited
A proximal method for composite minimization
A. S. Lewis, S. J. Wright
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important…
math.OC2008
Lipschitz behavior of the robust regularization
Adrian S. Lewis, C. H. Jeffrey Pang
To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the…
math.OC2008★ 4 cited
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
D. Leventhal, A. S. Lewis
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding…