Pages that link to "Item:Q2205976"

The following pages link to Efficient first-order methods for convex minimization: a constructive approach (Q2205976):

Displaying 11 items.

• Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions (Q2026726) (← links)
• Analysis of optimization algorithms via sum-of-squares (Q2046552) (← links)
• Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
• A frequency-domain analysis of inexact gradient methods (Q2149575) (← links)
• Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
• An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation (Q2666090) (← links)
• An optimal gradient method for smooth strongly convex minimization (Q6038652) (← links)
• Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← 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)