optimization - How to show that the method of steepest descent does not converge in a finite number of steps? - Mathematics Stack Exchange

I have a function, $$f(\mathbf{x})=x_1^2+4x_2^2-4x_1-8x_2,$$ which can also be expressed as $$f(\mathbf{x})=(x_1-2)^2+4(x_2-1)^2-8.$$ I've deduced the minimizer $\mathbf{x^*}$ as $(2,1)$ with $f^*

Steepest Descent Method - an overview

The Steepest Descent Algorithm. With an implementation in Rust., by applied.math.coding

Sensors, Free Full-Text

Mathematics, Free Full-Text

convergence divergence - Interpretation of Noise in Function Optimization - Mathematics Stack Exchange

optimization - Steepest Descent in elliptical error surface - Mathematics Stack Exchange

Energies, Free Full-Text

Solved I. Solve the following utility maximization problem

3 Optimization Algorithms The Mathematical Engineering of Deep Learning (2021)