Unconstrained optimisation and Hessian Matrix solving for convexity/concavity

138 Views Asked by At

Is it possible to reduce the Hessian Matrix with Gaussian elimination when we are trying to find if the function is concave or convex, assuming that all the inputs inside the Hessian matrix are scalars?

Follow up question relevant to matrices:

When trying to find the eigenvalues for the matrix, could be we reduce it first, or do we have to solve it as it is?

Thanks