Pages that link to "Item:Q511969"

The following pages link to On the convergence analysis of the optimized gradient method (Q511969):

Displaying 30 items.

• Optimized first-order methods for smooth convex minimization (Q312663) (← links)
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
• Theoretical connections between optimization algorithms based on an approximate gradient (Q1663476) (← links)
• Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
• Convergence of first-order methods via the convex conjugate (Q1728354) (← links)
• Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions (Q2026726) (← links)
• Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
• A piecewise conservative method for unconstrained convex optimization (Q2070340) (← links)
• A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm (Q2128772) (← links)
• Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
• A frequency-domain analysis of inexact gradient methods (Q2149575) (← links)
• Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition (Q2173914) (← links)
• Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
• The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions (Q2673524) (← links)
• General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) (← links)
• Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems (Q3300773) (← links)
• A Dynamical-System Analysis of the Optimum s-Gradient Algorithm (Q3567628) (← links)
• Generalizing the Optimized Gradient Method for Smooth Convex Minimization (Q4571883) (← links)
• Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA) (Q4603039) (← links)
• (Q4860594) (← links)
• (Q5053196) (← links)
• Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection (Q5123997) (← links)
• Potential-function proofs for gradient methods (Q5204822) (← links)
• Bilevel Methods for Image Reconstruction (Q5870782) (← links)
• An optimal gradient method for smooth strongly convex minimization (Q6038652) (← links)
• Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
• An elementary approach to tight worst case complexity analysis of gradient based methods (Q6165581) (← links)
• Tight ergodic sublinear convergence rate of the relaxed proximal point algorithm for monotone variational inequalities (Q6596341) (← links)
• Interpolation conditions for linear operators and applications to performance estimation problems (Q6601207) (← links)
• Several kinds of acceleration techniques for unconstrained optimization first-order algorithms (Q6665360) (← links)