Two steepest-descent algorithms with momentum for quadratic functions are considered. For a given learning rate, the sufficient and necessary conditions for the semistability of the steepest-descent algorithms with momentum are established. Moreover, the optimal momentum factors that generally make for the fastest convergence are obtained.

Issue Section:
Letters
© 2013 Massachusetts Institute of Technology
2013
You do not currently have access to this content.