QE2017 AC-3 ECE580 - Rhea

Student answers and discussions for Part 1,2,3,4,5

1.(20 pts) Considern the following linear program,

Convert the above linear program into standard form and find an initial basic feasible solution for the program in standard form.

2.(20 pts)

• (15 pts) FInd the largest range of the step-size, $ \alpha $, for which the fixed step gradient descent algorithm is guaranteed to convege to the minimizer of the quadratic function
  

starting from an arbitary initial condition $ x^{(0)} \in \mathbb{R}^{n} $, where $ x \in \mathbb{R}^{n} $, and $ Q = Q^{T} > 0 $.

• (5 pts) Find the largest range of the step size, $ \alpha $, for which the fixed step gradient descent algorithm is guaranteed to converge to the minimizer of the quadratic function
  

starting from an arbitrary initial condition $ x^{(0)} \in \mathbb{R}^{n} $

3. (20 pts) Is the function

locally convex, concave, or neither in the neighborhood of the point $ [2 -1]^{T} $? Justify your answer by giving all the details of your argument.

4. (20 pts) Solve the following optimization problem:

5. (20 pts) Solve the following optimization problem:

Back to ECE QE page