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

Stochastic gradient line Bayesian optimization for efficient noise-robust optimization of parameterized quantum circuits

Spatial convergence of Eulerian and strong semi-Lagrangian methods at

Solved 5. Suppose we use the method of steepest descent to

Linear programming - Wikipedia

A Steepest Descent Method for Set Optimization Problems with Set-Valued Mappings of Finite Cardinality

Mathematics, Free Full-Text

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

Convergence of the operator splitting (split-step) method (4.7) applied

Steepest Descent Direction - an overview

Mathematics, Free Full-Text