12.148 min read
Quadratic Case: Critical Points
For a quadratic function (symmetric ), the gradient is .
Setting the gradient to zero: , giving . If is invertible, the unique critical point is .
If is singular (not invertible): the system either has no solution (if , meaning no critical points) or infinitely many solutions (if , meaning an entire subspace of critical points).
Formal View
Theorem 12.8 — Critical Point of a Quadratic
For with symmetric : the critical points satisfy . If is invertible, the unique critical point is .
Interactive Visualization
Eigenvector Explorer
Why This Matters
Quadratic optimization is the backbone of all second-order methods and regularized regression.
- Least squares has a quadratic objective whose unique critical point is the normal equation solution
- Ridge regression adds making the Hessian positive definite and invertible
- All quadratic programming (QP) solvers exploit this structure
Quiz
Question 1
For with invertible symmetric , the unique critical point is:
Question 2
If is singular and , then has no critical points.
Common Mistakes
- Forgetting the factor of 2 in .
- Assuming a unique critical point exists without checking invertibility of .
- Confusing the critical point with the Hessian — the critical point is a vector, the Hessian is a matrix.