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^*

Energies, Free Full-Text

Steepest Descent Methods​ - NM EDUCATION

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

Applied Sciences, Free Full-Text

nonlinear optimization - Do we need steepest descent methods, when minimizing quadratic functions? - Mathematics Stack Exchange

Steepest Descent Method - an overview

Nonlinear programming - ppt download

Reference Request: Introduction to step-size complexity of optimization algorithms - Mathematics Stack Exchange

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

Unconstrained Nonlinear Optimization Algorithms - MATLAB & Simulink - MathWorks Nordic

machine learning - Does gradient descent always converge to an optimum? - Data Science Stack Exchange