activity
20202025
most citedOn complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization

8 citations · 9 across the 3 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

math.OC2020★ 8 cited

On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization

V. S. Amaral, R. Andreani, E. G. Birgin +2

Coordinate descent methods have considerable impact in global optimization because global (or, at least, almost global) minimization is affordable for low-dimensional problems. Coo…