Andrei Pătraşcu

On convergence of inexact projection gradient method for strongly convex minimization

2017

Dual methods can handle easily complicated constraints in convex problems, but they have typically slow (sublinear) convergence rate in an average primal point, even when the original problem has smooth strongly convex objective function. Primal …