Behavior of the Steepest Descent Method in Minimizing Rayleigh Quotient

概要

論文の詳細を見る
In this paper we discuss the limiting behavior of the search direction of the steepest descent method in minimizing the Rayleigh quotient. This minimization problem is equivalent to finding the smallest eigenvalue of a matrix. It is shown that the search direction asymptotically alternates between two directions represented by linear combinations of two eigenvectors of the matrix. This is similar to the phenomenon in minimizing the quadratic form. We also show that these eigenvectors correspond to the largest and second-smallest eigenvalues, unlike in the case of the quadratic form.
社団法人電子情報通信学会の論文
1997-01-25