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 12 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)
- Provably faster gradient descent via long steps (Q6579999) (← links)
- On the Bregman-proximal iterative algorithm for the monotone inclusion problem in Banach spaces (Q6593317) (← links)
- Interpolation conditions for linear operators and applications to performance estimation problems (Q6601207) (← links)
- A mirror inertial forward-reflected-backward splitting: convergence analysis beyond convexity and Lipschitz smoothness (Q6644234) (← links)
- Automated tight Lyapunov analysis for first-order methods (Q6665382) (← links)
- Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization (Q6667696) (← links)
