Pages that link to "Item:Q454335"

The following pages link to The chaotic nature of faster gradient descent methods (Q454335):

Displaying 12 items.

• Algorithms that satisfy a stopping criterion, probably (Q269806) (← links)
• An efficient gradient method using the Yuan steplength (Q480934) (← links)
• Schur properties of convolutions of gamma random variables (Q889154) (← links)
• Robust fitting of ellipsoids by separating interior and exterior points during optimization (Q1702591) (← links)
• Level set of the asymptotic rate of convergence for the method of steepest descent (Q2084237) (← links)
• Fast gradient methods with alignment for symmetric linear systems without using Cauchy step (Q2195925) (← links)
• Discrete processes and their continuous limits (Q2197184) (← links)
• Asymptotic rate of convergence of a two-layer iterative method of the variational type (Q2259485) (← links)
• Riemannian optimization and multidisciplinary design optimization (Q2358071) (← links)
• Runge-Kutta-like scaling techniques for first-order methods in convex optimization (Q2400802) (← links)
• Cooperative concurrent asynchronous computation of the solution of symmetric linear systems (Q2407864) (← links)
• Faster gradient descent and the efficient recovery of images (Q2510586) (← links)