Consider the problem for some vectors v , m &#x2208;<!-- ∈ --> <mrow class="MJ

sweetymoeyz 2022-07-08 Answered
Consider the problem for some vectors v , m R n :

f ( v ) = ( v T m ) 2

w.r.t v 2 = 1

I want to maximize f

If I consider the lagrangian, I get:

L ( v ) = ( v T m ) 2 + λ ( 1 v 2 )

Taking derivative, I get: 2 m m T v λ 2 v = 0 Therefore m m T v = λ v ( )

Multiplying by v T from left, I end up with

( v T m ) 2 = λ

If I put that in(*), I do cannot simplfy that.

Is there a trick I can apply?
You can still ask an expert for help

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

Freddy Doyle
Answered 2022-07-09 Author has 20 answers
You do not need much optimization here. Just note that ( v T m ) 2 = v T m m T v and that m m T is symmetric positive semidefinite with rank 1. The only nonnezero eigenvalue is given by m T m. Therefore, we have that
0 v T m m T v m T m
for all v R n . The maximum is attained for v = m / | | m | | which is normalized eigenvector associated with the unique positive eigenvalue. Note that it is also attained for v = m / | | m | | .

The difficulty here with using Lagrange multipliers is that m m T is not invertible and one has to restrict v to the subspace where m m T v 0. That is you can solve for the problem where v = α m and pick α such that the norm of v is one.
Not exactly what you’re looking for?
Ask My Question

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-06-04
I'm a first year Finance grad student and we're learning utility maximization problem now. We have been assuming that a solution to these problems exists. Are there any general theorem about the existence of maximization solution on R n ? I have encountered once that "A utility maximization problem with a continuous utility function on a compact set has solution". Thanks in advance!
asked 2022-07-08
f ( x , y , z ) = x y + z 2 ,
while 2 x y = 0 and x + z = 0. Lagrange doesnt seem to work.
asked 2022-06-26
x 2 y max,
such that x 2 + 4 x y 1 , x 0 and y 0.

I think I need to use the KKT conditions here. I did however not yet succeed in solving it, so could someone please give me an example of how this should be done? And should I include the constraints x 0 and y 0 into the Lagrangian function?
asked 2022-06-21
I'm having trouble understanding how to check the second order conditions for my unconstrained maximization problem.

This is the entire problem: Alicia wants to maximize her grade, which is a function of the time spent studying ( T) and the number of cups of coffee ( C) she drinks. Her grade out of 100 is given by the following function.
G ( T , C ) = 50 + 10 T + 16 C ( T 2 + 2 T C + 2 C 2 )
In the first order conditions, I find the partial derivatives and set them equal to zero. I get the following two equations:

10 2 T 2 C = 0 and 16 2 T 4 c = 0. The first equation was the partial derivative with respect to T and the second equation was the partial derivative with respect to C. Solving these two equations, I find that C = 3 and T = 2.

Now, I need to check the second order conditions. I know that the second partial derivative with respect to both T and C should be negative. This checks out. I get -2 from the first equation (with respect to T) and I get -4 from the second equation (with respect to C). The last thing I need to do with the second order condition is multiply these two together (which yields 8) and then subtract the following:
( δ 2 G δ T δ C ) 2
Please forgive me if this formula isn't displaying correctly. I tried using the laTex equation editor, but I'm not sure if it worked. Anyway, I need to know how to derive this. What is it asking for? I know that this part should be -2 squared, which is 4. Then, 8-4=4, which is positive and tells me that the second order conditions are met.

But where is the -2 coming from? I know within both of the equations, there are a few -2's. But, I'm not sure exactly where this -2 comes from.
asked 2022-06-21
Just come across a question regarding sequential maximization and simultaneous maximization, and I do not recall whether there are any established conditions for the equivalence. Anyone has some idea?
max x max y f ( x , y ) = max y max x f ( x , y ) ?
asked 2022-06-24
Define the function
f ( a , b , c , α , β , γ , x ) = max ( 0 , max ( ( a + x ) α , ( b + x ) β ) ( c + x ) γ ) ,
a , b , c , α , β , γ , x [ 0 , M ] .
Is it true that for any
ξ = ( a , b , c , α , β , γ ) ,
the maximum of f ( ξ , ) occurs either when x = 0 or x = M?

I think the answer is yes, but I have trouble prooving it.
My argument is as follows:
Given any ξ, f ( ξ , c ) will be
f ( ξ , x ) = { 0 case A ( a + x ) α ( c + x ) γ case B ( b + x ) β ( c + x ) γ case C
Hence, f ( ξ , x ) is a linear function of x in all three cases, and the result follows.

I think this argument works only if each case is independent of x, but this is not the case.

As, when ξ is given, judiciously choosing x may put f in another case.

What would be a right way to prove this result?
asked 2022-06-24
let T 1 be some finite integer, solve the following maximization problem.
Maximize t = 1 T ( 1 2 ) x t subject to t = 1 T , x t 1, x t 0, t=1,...,T
I have never had to maximize summations before and I do not know how to do so. Can someone show me a step by step break down of the solution?

New questions