Pages that link to "Item:Q2089862"
From MaRDI portal
The following pages link to On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862):
Displaying 5 items.
- Coordinate great circle descent algorithm with application to single-index models (Q896588) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- Optimization of the first Dirichlet Laplacian eigenvalue with respect to a union of balls (Q2698557) (← links)
- A block-coordinate approach of multi-level optimization with an application to physics-informed neural networks (Q6624433) (← links)
- Worst case complexity bounds for linesearch-type derivative-free algorithms (Q6636792) (← links)
