2007 Volume 37 Issue 1 Pages 105-121
An algebraic method is suggested to search for the optimal solution that maximizes a correlation criterion under a quadratic constraint. First it is shown that the problem formulated in a sample space can be reformulated in a parameter space, and then some properties of a matrix which specifies the quadratic constraint are provided along with its geometrical interpretation; the solution can be obtained by solving a nonlinear equation derived from the singular value decomposition of the matrix. Numerical results based on artificial data and entrance examination data are given to examine how our solution differs from the least squares solution under a quadratic constraint.
