For some computable functions convex in each variable, block Gauss-Seidel coordinate descent has no Turing-computable argmin step and no effective stopping rule, so performance guarantees are impossible.
Arimoto, An algorithm for computing the capacity of arbitrary discrete memoryless chan- nels, IEEE Trans
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
support 1representative citing papers
citing papers explorer
-
Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
For some computable functions convex in each variable, block Gauss-Seidel coordinate descent has no Turing-computable argmin step and no effective stopping rule, so performance guarantees are impossible.