For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Behavior of the Steepest Descent Method in Minimizing Rayleigh Quotient
Takashi OZEKI Taizo IIJIMA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/01/25
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Numerical Analysis and Optimization
numerical analysis, steepest descent method, Rayleigh quotient, eigenvalue problem, search direction,
Full Text: PDF>>
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.