Coordinate permutation is claimed to guarantee coverage of the global optimum in nonsmooth nonconvex optimization, but the proof assumes the coverage property it concludes and the convergence-rate result is a tautological norm fact.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Permutation Randomization on Nonsmooth Nonconvex Optimization: A Theoretical and Experimental Study
Coordinate permutation is claimed to guarantee coverage of the global optimum in nonsmooth nonconvex optimization, but the proof assumes the coverage property it concludes and the convergence-rate result is a tautological norm fact.