Pages that link to "Item:Q4620416"
From MaRDI portal
The following pages link to Convergence Rates of Proximal Gradient Methods via the Convex Conjugate (Q4620416):
Displaying 13 items.
- On the convergence rate of entropic proximal optimization methods (Q1328480) (← links)
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100) (← links)
- Convergence of first-order methods via the convex conjugate (Q1728354) (← links)
- Convergence rates of accelerated proximal gradient algorithms under independent noise (Q2420162) (← links)
- Perturbed Fenchel duality and first-order methods (Q2687051) (← links)
- Convergence rate of a proximal multiplier algorithm for separable convex minimization (Q2970394) (← links)
- Convergence rates of convex variational regularization (Q4664387) (← links)
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems (Q5151529) (← links)
- Affine Invariant Convergence Rates of the Conditional Gradient Method (Q6076864) (← links)
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization (Q6126650) (← links)
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm (Q6138297) (← links)
- Convergence rate analysis of the proximal difference of the convex algorithm (Q6483801) (← links)
- Convergence properties of proximal (sub)gradient methods without convexity or smoothness of any of the functions (Q6663109) (← links)