# Geometric descent method for convex composite minimization

In this paper, we extend the geometric descent method recently proposed by Bubeck, Lee and Singh to tackle nonsmooth and strongly convex composite problems. We prove that our proposed algorithm, dubbed geometric proximal gradient method (GeoPG), converges with a linear rate $(1-1/\sqrt{\kappa})$ and thus achieves the optimal rate among first-order methods, where $\kappa$ is the condition number of the problem... (read more)

PDF Abstract NeurIPS 2017 PDF NeurIPS 2017 Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now