A link between the steepest descent method and fixed-point iterations
arXiv:2109.09108 · doi:10.1007/s11590-022-01867-9
Abstract
We will make a link between the steepest descent method for an unconstrained minimisation problem and fixed-point iterations for its Euler-Lagrange equation. In this context, we shall rediscover the preconditioned nonlinear conjugate gradient method for the discretised problem. The benefit of the link between the two methods will be illustrated by a numerical experiment.
References in corpus (4)
- Rate optimal adaptive FEM with inexact solver for nonlinear operators
- Rate optimality of adaptive finite element methods with respect to the overall computational costs
- Energy minimization using Sobolev gradients: application to phase separation and ordering
- Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver