Problem 8. Let n 2 2. Consider the following optimization problem min n(n-1) 1 i=1 Show that (0,1...
(45 Points) Consider the constrained optimization problem: min f(x1, x2) = 2x} + 9x2 + 9x2 - 6x1x2 – 18x1 X1 X2 Subject to 4x1 – 3x2 s 20 X1 + 2x2 < 10 -X1 < 0, - x2 < 0 a) Is this problem convex? Justify your answer. (5 Points) b) Form the Lagrange function. (5 Points) c) Formulate KKT conditions. (10 Points) d) Recall that one technique for finding roots of KKT condition is to check all permutations...
Consider the following linear regression model 1. For any X = x, let Y = xB+U, where B erk. 2. X is exogenous. 3. The probability model is {f(u; ) is a distribution on R: Ef [U] = 0, VAR; [U] = 62,0 >0}. 4. Sampling model: {Y}}}=1 is an independent sample, sequentially generated using Y; = xiß +Ui, where the U; are IID(0,62). (i) Let K > 0 be a given number. We wish to estimate B using least-squares...
Consider the following linear regression model 1. For any X x, let Y xBU, where 3 E R*. 2. X is exogenous 3. The probability model is {f(u;0) is a distribution on R: Ef [U] = 0, VAR, [U] = 02,0 > 0}. 4. Sampling model: Y} anidependent sample, sequentially generated using Yi x Ui,where the U IID(0,0) are (i) Let K 0 be a given number. We wish to estimate B using least-squares subject to the constraint 6BK2. Write...
(1) Consider the optimization problem: minimize |Ar bll where A E Rmxn, m 2 n and bE Rm. Show that the objective function is a quadratic function. Calculate the gradient and the Hessian for this quadratic function.
(1) Consider the optimization problem: minimize |Ar bll where A E Rmxn, m 2 n and bE Rm. Show that the objective function is a quadratic function. Calculate the gradient and the Hessian for this quadratic function.
4. Show that the solution of optimization problem for K-means is not unique arg min
1. Consider the constrained optimization problem: min f(x,x2) - (x-3)2 (x2 -3)2 Subject to Is this problem convex? Justify your answer Form the Lagrangian function. a. b. Check the necessary and sufficient conditions for candidate local minimum points. Note that equality constraint for a feasible point is always an active constraint c. d. Is the solution you found in part (c) a global minimum? Explain your answer
8.(15 POINTS) Consider the following optimization problem: Max xi + subject to : 5xí +60192 + 5x3 = 1 and 21 > 0,22 > 0. where 2 and 32 are choice variables. (a) Write the Lagrangean and the Kuhn-Tucker conditions. (6) State and verify the second order condition. Distinguish between sufficient and necessary condi tions. (c) Is the constraint qualification condition satisfied? Show clearly why or why not. (d) Solve the Kuhn-Tucker conditions for the optimal choice: x1, x, and...
Problem 1: Consider the following linear optimization problem: max +22 +rs subject to X1 + X2 + X3 = 10 2x1 - 22 24 i 20, 1,2,3. (a) Bring the problem to a standard form. (b) Show that the point (2,8,0)Ts optimal by the optimality condition of the linear program- ming. Is it an extreme point? Provide arguments for your answers. (c) Determine at least one other point different than (2,8,0)T, which is an extreme point of the constraint set...
Equation(1):
2. Consider a two state DTMC with state space E = {1 ,2). Let T = min(n > 0 : Xn-1) (i) Compute E(TIXo = 2) using a geometric distribution. (ii) Use (1) to compute E(T Xo 2). 0), and Vi(n) i rst-step analysis to show that
2. Consider a two state DTMC with state space E = {1 ,2). Let T = min(n > 0 : Xn-1) (i) Compute E(TIXo = 2) using a geometric distribution. (ii) Use...
Problem 5 Let x ~ Pa, a Pareto distribution....
Problem 2. Consider 31, ... ,In ..d. N(0,0%) and the prior, T(0,0) = o-2(a+1)exp(-sa/20?). Compute and identify the posterior distribution 7(0,023,...,n) and show that it only depends on i and s? = 21-11; - 7)? Problem 3. Let ~ N(0,1). Assume that the prior median of @ is 0, the first quartile is -2, and the third quartile is +2. Then, if the prior distribution on 8 is of the form...