subject - Optimization

4. Consider the following non-linear optimization problem: min:dx(cx)2s.t.:Axb, where we assume that Axbdx>0. (a) Show that this problem is convex. (b) Reformulate this problem as an SDP. (Hint: it may be useful for you to add an additional dummy variable that will allow you to move the objective function into the constraints). 4. Consider the following non-linear optimization problem: min:dx(cx)2s.t.:Axb, where we assume that Axbdx>0. (a) Show that this problem is convex. (b) Reformulate this problem as an SDP. (Hint: it may be useful for you to add an additional dummy variable that will allow you to move the objective function into the constraints)