The gradient vanishes at . Decompose any vector as , with . Symmetry of and imply . Since ,
If , choose a nonzero . Arbitrarily close to zero, the direction gives negative values and the direction gives positive values. Thus is a saddle point for . Equivalently, the Hessian matrix has one negative eigenvalue and all its other eigenvalues positive.
The dimension matters: if , the orthogonal complement is zero-dimensional and . In that case is the unique global maximum. This edge case is not excluded by the stated hypotheses. The decomposition is a rank-one downdate along an eigenvector.

Articles by others on the same topic (0)

There are currently no matching articles.