On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization |
scientific article |
Statements
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (English)
0 references
24 October 2022
0 references
coordinate descent methods
0 references
bound-constrained minimization
0 references
worst-case evaluation complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
