Pages that link to "Item:Q278924"
From MaRDI portal
The following pages link to The steepest descent algorithm without line search for \(p\)-Laplacian (Q278924):
Displayed 6 items.
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems (Q1649149) (← links)
- Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms (Q1685240) (← links)
- A \(hk\) mortar spectral element method for the \(p\)-Laplacian equation (Q2293601) (← links)
- Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) (← links)
- A Hybridizable Discontinuous Galerkin Method for the $p$-Laplacian (Q2790076) (← links)
- Relaxed Kačanov Scheme for the \(\boldsymbol{p}\)-Laplacian with Large Exponent (Q6091101) (← links)