multivariable unconstrained problem
optimization
1. (Total: 10 points) Given the matrix 1 A = [1 3] -1 1 and the vector q = (1, 2, −1, 3)¹ € R¹. a) Find the vector x in the null space N(A) of A which is closest to q among all vectors in N(A).