A Class of Linear Programs Solvable by Coordinate-Wise Minimization

Tomáš Dlask, Tomáš Werner

Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable) convex problems it may not find global minima.…