机译:On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
University of Campinas;
University of S?o Paulo;
Coordinate descent methods; Bound-constrained minimization; Worst-case evaluation complexity;