Pages that link to "Item:Q1679617"

The following pages link to On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617):

Displaying 5 items.

• An optimal gradient method for smooth strongly convex minimization (Q6038652) (← links)
• Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482) (← 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)
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)