Pages that link to "Item:Q6097482"

The following pages link to Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482):

Displaying 10 items.

• Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition (Q2089864) (← links)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
• Linearly convergent away-step conditional gradient for non-strongly convex functions (Q2364483) (← links)
• Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
• (Q3792495) (← links)
• On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)
• Interpolation conditions for linear operators and applications to performance estimation problems (Q6601207) (← links)
• The exact worst-case convergence rate of the alternating direction method of multipliers (Q6634526) (← links)
• Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems (Q6644990) (← links)