The steepest descent algorithm without line search for \(p\)-Laplacian

DOI10.1016/j.amc.2013.07.096zbMath1337.65163OpenAlexW2026635474MaRDI QIDQ278924

Guangming Zhou, Chunsheng Feng

Publication date: 27 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.07.096

zbMATH Keywords

finite element approximationcontinuation method\(p\)-Laplaciansteepest descent algorithmnumerical experimentmultigrid solver

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Quasilinear elliptic equations with (p)-Laplacian (35J92)

Related Items (6)

A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems ⋮ Fast gradient methods for uniformly convex and weakly smooth problems ⋮ Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms ⋮ Relaxed Kačanov Scheme for the \(\boldsymbol{p}\)-Laplacian with Large Exponent ⋮ A Hybridizable Discontinuous Galerkin Method for the $p$-Laplacian ⋮ A \(hk\) mortar spectral element method for the \(p\)-Laplacian equation

This page was built for publication: The steepest descent algorithm without line search for \(p\)-Laplacian