Discrete weak duality of hybrid high-order methods for convex minimization problems
DOI10.1137/23m1594534zbMATH Open1544.65212MaRDI QIDQ6573779
Publication date: 17 July 2024
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
a prioriconvex minimizationadaptive mesh-refininga posterioridiscrete weak convex dualityhybrid high order
Numerical optimization and variational techniques (65K10) Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A natural nonconforming FEM for the Bingham flow problem is quasi-optimal
- Axioms of adaptivity
- An arbitrary-order and compact-stencil discretization of diffusion on general meshes based on local reconstruction operators
- Mathematical aspects of discontinuous Galerkin methods.
- Finite element error estimates for nonlinear elliptic equations of monotone type
- A note on the Poincaré inequality for convex domains
- Hybrid high-order methods for finite deformations of hyperelastic materials
- A hybrid high-order locking-free method for linear elasticity on general meshes
- Remarks around 50 lines of Matlab: short finite element implementation
- Nonconforming discretizations of convex minimization problems and precise relations to mixed methods
- Improved error estimates for hybrid high-order discretizations of Leray-Lions problems
- The hybrid high-order method for polytopal meshes. Design, analysis, and applications
- A convergent adaptive finite element method for an optimal design problem
- Interpolation operators in Orlicz--Sobolev spaces
- Convergent adaptive hybrid higher-order schemes for convex minimization
- An arbitrary-order discrete de Rham complex on polyhedral meshes: exactness, Poincaré inequalities, and consistency
- Bridging the hybrid high-order and hybridizable discontinuous Galerkin methods
- A local discontinuous Galerkin approximation for systems with p-structure
- A Hybrid High-Order method for Leray–Lions elliptic equations on general meshes
- Fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra
- Linear Convergence of an Adaptive Finite Element Method for the p-Laplacian Equation
- An Inexpensive Method for the Evaluation of the Solution of the Lowest Order Raviart–Thomas Mixed Method
- Optimal design and relaxation of variational problems, I
- Finite Element Approximation of the p-Laplacian
- Numerical solution of the scalar double-well problem allowing microstructure
- A Posteriori Finite Element Error Control for the P-Laplace Problem
- A Hybrid High-Order Method for Nonlinear Elasticity
- A posteriori error estimation for variational problems with uniformly convex functionals
- Error estimates for a class of discontinuous Galerkin methods for nonsmooth problems via convex duality relations
- Unstabilized Hybrid High-order Method for a Class of Degenerate Convex Minimization Problems
- Stable broken $H^1$ and $H(\mathrm {div})$ polynomial extensions for polynomial-degree-robust potential and flux reconstruction in three space dimensions
- Nonconforming FEMs for an Optimal Design Problem
- Polynomial-Degree-Robust A Posteriori Estimates in a Unified Setting for Conforming, Nonconforming, Discontinuous Galerkin, and Mixed Discretizations
- Equilibrated residual error estimator for edge elements
- ESTIMATES OF BEST CONSTANTS FOR WEIGHTED POINCARÉ INEQUALITIES ON CONVEX DOMAINS
- Convex Analysis
- Introduction
- Explicit and efficient error estimation for convex minimization problems
- Error analysis for a Crouzeix-Raviart approximation of the \(p\)-Dirichlet problem
This page was built for publication: Discrete weak duality of hybrid high-order methods for convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573779)
