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

Drones, Free Full-Text

Finite Difference Interpolation for Reduction of Grid-Related Errors in Real-Space Pseudopotential Density Functional Theory

A reinforcement learning approach to airfoil shape optimization

Mini-batch optimization enables training of ODE models on large-scale datasets

ordinary differential equations - Finite-time criterion for ODE - Mathematics Stack Exchange

Steepest Descent Method - an overview

An overview of gradient descent optimization algorithms

Illustration of the TOBS with geometry trimming procedure (TOBS-GT)

Correspondence between neuroevolution and gradient descent

Ant colony optimization algorithms - Wikipedia

Unconstrained Nonlinear Optimization Algorithms - MATLAB & Simulink - MathWorks Nordic

Restricted-Variance Constrained, Reaction Path, and Transition State Molecular Optimizations Using Gradient-Enhanced Kriging

Nonlinear programming - ppt download