Convergent adaptive hybrid higher-order schemes for convex minimization (Q2671266)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergent adaptive hybrid higher-order schemes for convex minimization |
scientific article |
Statements
Convergent adaptive hybrid higher-order schemes for convex minimization (English)
0 references
3 June 2022
0 references
This article proposes two convergent adaptive mesh-refining algorithms for the hybrid high-order method in convex minimization problems with two-sided \(p\)-growth. Three examples including the \(p\)-Laplacian, an optimal design problem, and the relaxed two-well problem are considered. The plain convergence of an adaptive scheme is proved and an application to the Lavrentiev gap is also investigated. Several numerical examples are provided to confirm the theoretical results.
0 references
convex minimization
0 references
degenerate convex
0 references
convexity control
0 references
hybrid high-order
0 references
\(p\)-Laplacian
0 references
optimal design problem
0 references
double-well problem
0 references
a posteriori
0 references
adaptive mesh-refining
0 references
convergence
0 references
Lavrentiev gap
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
