Search Results for author:
Found 3 papers, 0 papers with code
Super-Reparametrizations of Weighted CSPs: Properties and Optimization Perspective
The notion of reparametrizations of Weighted CSPs (WCSPs) (also known as equivalence-preserving transformations of WCSPs) is well-known and finds its use in many algorithms to approximate or bound the optimal WCSP value.
A Class of Linear Programs Solvable by Coordinate-Wise Minimization
We show that dual LP relaxations of several well-known combinatorial optimization problems are in this class and the method finds a global minimum with sufficient accuracy in reasonable runtimes.
Relative Interior Rule in Block-Coordinate Minimization
While for some problems, coordinate minimization converges to a global minimum (e. g., convex differentiable objective), for general (non-differentiable) convex problems this may not be the case.
