Martin Takáč (University of Edinburgh)

Iteration complexity of random coordinate descent method
Wednesday 23 November 2011 at 15.30, JCMB 6206


Coordinate Descent Method is quite old iterative optimization method, where one can move in each iteration only in coordinate directions. We will show how to analyze the complexity when one choose coordinate directions randomly. We will also discuss some extensions of coordinate descent method.