Consider the following non-linear optimization (NLO) problem: min such that x3 + x X1 + X3 1 1 + x = 1 X2 + 2.1 Reduced this problem to an unconstrained optimization problem. 2p 2.2 Starting at the point x = (2, 1)?, compute the first DFP iterate x1 assuming that Ho is the identity matrix. Note: If a line search is needed, you are allowed to perform a full step instead. 2.3 Determine Do. 2p 3p Consider the following non-linear optimization (NLO) problem: min such that x3 + x X1 + X3 1 1 + x = 1 X2 + 2.1 Reduced this problem to an unconstrained optimization problem. 2p 2.2 Starting at the point x = (2, 1)?, compute the first DFP iterate x1 assuming that Ho is the identity matrix. Note: If a line search is needed, you are allowed to perform a full step instead. 2.3 Determine Do. 2p 3p