scientific article; zbMATH DE number 4031421

From MaRDI portal
Publication:3771986





[For the entire collection see Zbl 0627.00013.] Let \((M,g)\) be a complete finite dimensional Riemannian manifold. Suppose we have a real function \(f: M\to R\) and we want to find one of its minima. The remark that -grad f is a vector field orthogonal to the hypersurface of constant level of f, which shows at every point \(x\in M\) the direction of steepest descent suggests that the most suitable solution of the inequality \(df(x_ i)(X)<0\) is \(X_ i=-\text{grad} f(x_ i)\). From this choice results an iterative process which we call ``the method of steepest descent of the gradient method, having in mind the well-known Euclidean model.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771986)