Pages that link to "Item:Q2673524"
From MaRDI portal
The following pages link to The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions (Q2673524):
Displaying 8 items.
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617) (← links)
- A note on the optimal convergence rate of descent methods with fixed step sizes for smooth strongly convex functions (Q2671453) (← links)
- Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482) (← links)
- Heterogeneous Mediation Analysis on Epigenomic PTSD and Traumatic Stress in a Predominantly African American Cohort (Q6110691) (← links)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
- On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)
- PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python (Q6645946) (← links)