I knew about "Coordinate descent" and "Gradient descent" algorithms before; they are well-known and Wikipedia has articles for those. However I recently came across an algorithm called "Coordinate gradient descent".
How does this algorithm exactly work, and how does it relate to "Coordinate descent" and "Gradient descent"?
An example for usage of this term can be found on slide 7 at the link http://courses.cs.washington.edu/courses/cse546/12wi/slides/cse546wi12ClusteringEM.pdf. I think what K-means or EM does is "Coordinate gradient descent" (or "Coordinate gradient ascent", based on how you view the optimization), but I could not figure out the intuition behind the name.