I- Consider the problem of minimizing a general quadratic function subject to a linear constraint:
minimize21x⊤Qx−c⊤x+d
subject toAx=b
where
Q=Q⊤>0 (PD),
A∈Rm×n,
m<n,
rank(A)=m,
b∈Rm,
c∈Rn,
and d is a real constant.
i) Is this optimization problem convex?
ii) Prove that this problem admits a unique global minimizer.
iii) Show that any feasible point is regular.
iv) Derive a closed-form solution to this problem.
II- Consider the following optimization problem:
Minimizex12+2x1x2+3x22+2x32+4x1+5x2+6x3
subject tox1+2x2=3
4x1+5x3=6
a) Show that this problem has the same form as the problem in Part I. Verify whether all conditions in Part I are satisfied.
b) Solve this optimization problem using the results from Part I.
Hint: If
Q=220260004,A=[142005],
then
Q−1=413−10−110001,B=AQ−1A⊤=41[34473].