Pages that link to "Item:Q2149545"
From MaRDI portal
The following pages link to Optimal complexity and certification of Bregman first-order methods (Q2149545):
Displaying 6 items.
- Numerical methods for some classes of variational inequalities with relatively strongly monotone operators (Q2680746) (← links)
- Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy (Q6076867) (← links)
- Stochastic composition optimization of functions without Lipschitz continuous gradient (Q6108982) (← links)
- Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization (Q6114954) (← links)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)
- Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
