Try   HackMD

Rayleigh quotient of a diagonal matrix

Problem

Let

A=[300040005] and x=[xyz].

Solve the optimization problem

maxxAx,subject tox=1.

Thought

The purpose of this problem is to get a feeling of the Rayleigh quotient theorem, so you are encouraged to solve it by fundamental methods rather than the theorem.

Sample answer

By direct calculation, the optimization is the same as

max3x2+4y2+5z2,subject tox2+y2+z2=1.

By replacing

x2=p1,
y2=p2
, and
z2=p3
, we noticed that
p1,p2,p33
and
p1+p2+p3=1
. That is,
(p1,p2,p3)
is a probability distribution. Now the problem is equivalent to

maxp33+p24+p35,subject to(p1,p2,p3) is a probability distribution.

Under this framework, we are maxizing the weighted average of

3,4,5 with respect to the weights
p1,p2,p3
. Thus, the weighted average is between the minimum value
3
and the maximum value
5
. Thus, the maximum value is
5
, achieved by
(x,y,z)=(0,0,1)
or
(x,y,z)=(0,0,1)
.

This note can be found at Course website > Learning resources.