Consider the following projection problem minimize ||x-z||^2 subject to Ax = 0; where the m ? n matrix A and the vector z 2 Rn are given. (a) Derive the dual of the problem. (b) Show that the dual problem is also a projection problem on a subspace.

.19875994384

step-by-step explanation:

1699/ 8548

$320 to $405

step by step explanation:

in one day he earns between $64 and $81

therefore if he works for 5 days, he will earn between 64 x 5 to 81 x 5

= $320 to $405

given the equation is 8+9z=-6, the first step would be to subtract the 8 from both sides:

8+9z-8=-6-8

since 8 minus 8 = 0, this would cancel out the 8. and since -6 minus 8 equals -14, the equation would look like this

9z = -14