4 citations · 4 across the 2 of their papers we have counts for
3 papers
math.OC2020
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.…
math.OC2019★ 4 cited
Relative Interior Rule in Block-Coordinate Minimization
Tomáš Werner, Daniel Průša
(Block-)coordinate minimization is an iterative optimization method which in every iteration finds a global minimum of the objective over a variable or a subset of variables, while…
math.OC2017
On Coordinate Minimization of Convex Piecewise-Affine Functions
Tomas Werner
A popular class of algorithms to optimize the dual LP relaxation of the discrete energy minimization problem (a.k.a.\ MAP inference in graphical models or valued constraint satisfa…