Consider the following optimization problem: minimize 71 subject tox,- r, where r > 0 is a given scalar 1. Write dow...
Consider the optimization problem minimize f(x) subject to αεΩ where f(x) = x122, where x = [11, [2], and N = {x € R2 : x1 = 22, Xı >0}. (a) Find all points satisfying the KKT condition. (b) Do each of the points found in part (a) satisfy the second-order necessary condition? (c) Do each of the points found in part (a) satisfy the second-order sufficient condition?
Given three numbers n, m, r and a constant matrix Z E R"Xm, consider the optimization problem minimize Z- XY subject toX20, Y20 (note that the sign"2" means that all elements of the corresponding matrix are nonnegative, and thatIF denotes the Frobenius norm). (10 points) Write the first-order optimality conditions for (1). (10 points) Describe how to solve (1) using the gradient projection method with the step size along the feasible direction chosen to be and the step size along...
Consider the optimization problem 5-6 5-6 F=(X-I)2 + (X Minimize: Subject to: 2-1) X +X-0.5s 0 a. Write the expression for the augmented Lagrangian using r'p = 1. b. Beginning with λ 1 0 and λ2-0 , perform three iterations of the ALM method. c. Repeat part (b), beginning with λ 1-1 and λ2-1 d. Repeat part (b), beginning with λι--I and λ2--1
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...
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...
Consider the problem minimize 1[r(-)] = 2 / r,(t)2 dt subject to the conditions r(0) - r(T)0 and the constraint 0 r(t)2 dt 1. = Suppose that r : [0, π] R is a C2 function that! solves the above Let y : [0, π] R be any other C2 function such that y(0) Define problem a(s): (r(t) + sy(t))2 dt and a(s) a. Explain why a(0) 1 and i'(0) 0. b. Show that i'(0)= | z'(t) y' (t) dt-X...
Exercise 4.1 Consider the linear programming problem: minimize 1 2 subject to 21 3x23A K 0 321 2 + 4r3 2x4 2 3 1 0 2,320. Write down the corresponding dual problem
(5) Consider the problem: minimize I[r(.)] - /r2 dt 0 subject to the conditions x(0)-x()-0 and the constraint 0 R is a C2 function that solves the above Suppose that x : [0, π] Let y : [0, π] → R be any other C2 function such that y(0) = Define problem y(n) 0. 0 an a(s) a. Explain why α(0)-1 and i'(0) b. Show that 0. i'(0)r'(t) y'(t) dt -X /x(t) y(t) dt 0 0 for some constant λ,...
(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.
Prove that x*-(1, 1/2-1) is optimal for the optimization problem (1/2)xTPx + qTr + r -1 xi<1, i-1,2,3, minimize subject to where 13 12-2 22.0 P-12 176 14.5 2 6 12 13.0
Prove that x*-(1, 1/2-1) is optimal for the optimization problem (1/2)xTPx + qTr + r -1 xi