The following pages link to Rachael Tappenden (Q306307):
Displaying 13 items.
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases (Q820723) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- A flexible ADMM algorithm for big data applications (Q1704789) (← links)
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
- Efficient calculation of regular simplex gradients (Q2419521) (← links)
- Separable approximations and decomposition methods for the augmented Lagrangian (Q2943840) (← links)
- (Q2953662) (← links)
- On the complexity of parallel coordinate descent (Q4638927) (← links)
- Determinant and Exchange Algorithms for Observation Subset Selection (Q5366492) (← links)
- Decentralized personalized federated learning: lower bounds and optimal algorithm for all personalization modes (Q6170035) (← links)
- On a Family of Relaxed Gradient Descent Methods for Quadratic Minimization (Q6532652) (← links)
- Stochastic gradient methods with preconditioned updates (Q6536836) (← links)
