Pages that link to "Item:Q1670100"

The following pages link to Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100):

Displaying 11 items.

• Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
• 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)
• A frequency-domain analysis of inexact gradient methods (Q2149575) (← links)
• Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
• Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• A note on the optimal convergence rate of descent methods with fixed step sizes for smooth strongly convex functions (Q2671453) (← links)
• Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems (Q3300773) (← links)
• An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee (Q6057272) (← links)
• Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)