Pages that link to "Item:Q344947"
From MaRDI portal
The following pages link to An optimal variant of Kelley's cutting-plane method (Q344947):
Displaying 9 items.
- The exact information-based complexity of smooth convex minimization (Q511109) (← links)
- On the convergence analysis of the optimized gradient method (Q511969) (← links)
- Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
- Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems (Q3300773) (← links)
- Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
- Linear Programming on the Stiefel Manifold (Q6202765) (← links)
