A link between the steepest descent method and fixed-point iterations

09/19/2021

∙

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.

READ FULL TEXT

A link between the steepest descent method and fixed-point iterations

Chebyshev Inertial Iteration for Accelerating Fixed-Point Iterations

Euler-Bernoulli beams with contact forces: existence, uniqueness, and numerical solutions

Fixed-point iterations for several dissimilarity measure barycenters in the Gaussian case

Effective Response of Heterogeneous Materials using the Recursive Projection Method

Application of accelerated fixed-point algorithms to hydrodynamic well-fracture coupling

Fixed Point Iterations for SURE-based PSF Estimation for Image Deconvolution

An Overflow Free Fixed-point Eigenvalue Decomposition Algorithm: Case Study of Dimensionality Reduction in Hyperspectral Images

A link between the steepest descent method and fixed-point iterations

Related Research

Chebyshev Inertial Iteration for Accelerating Fixed-Point Iterations

Euler-Bernoulli beams with contact forces: existence, uniqueness, and numerical solutions

Fixed-point iterations for several dissimilarity measure barycenters in the Gaussian case

Effective Response of Heterogeneous Materials using the Recursive Projection Method

Application of accelerated fixed-point algorithms to hydrodynamic well-fracture coupling

Fixed Point Iterations for SURE-based PSF Estimation for Image Deconvolution

An Overflow Free Fixed-point Eigenvalue Decomposition Algorithm: Case Study of Dimensionality Reduction in Hyperspectral Images