optimization - How to show that the method of steepest descent does not converge in a finite number of steps? - Mathematics Stack Exchange
Por um escritor misterioso
Last updated 15 março 2025

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

convergence divergence - Steepest-descent optimization procedure with step size given by harmonic sequence - Mathematics Stack Exchange

Quasi-Newton methods for topology optimization using a level-set method

Quasi-Newton methods for topology optimization using a level-set method

Mathematics, Free Full-Text

Steepest Descent Methods - NM EDUCATION

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

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

Enhancing grasshopper optimization algorithm (GOA) with levy flight for engineering applications

Steepest Descent Method - an overview
Solved 2. In this problem we study the convergence property

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

Electronics, Free Full-Text

Mini-batch optimization enables training of ODE models on large-scale datasets
Solved P5.1 Use the method of steepest descent to solve the