Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization II: If f = f₀ + Σf_k Is Quasiconvex and Hemivariate in Each Block, BCD Cluster Points Are Coordinatewise MinimaResearch Paper
Block coordinate descent (BCD), also called the nonlinear Gauss–Seidel method or alternating minimization, minimizes a function of several blocks of variables by exactly minimizing over one block at a time while the others are held fixed. It is used wherever the subproblem in a single block is cheap even though the joint problem is not: alternating least…