Related papers: Optimization under second order constraints: are t…
In this paper error analysis for finite element discretizations of Dirichlet boundary control problems is developed. For the first time, optimal discretization error estimates are established in the case of three dimensional polyhedral and…
In this paper, we propose and analyze a finite element discretization for the computation of fractional minimal graphs of order~$s \in (0,1/2)$ on a bounded domain $\Omega$. Such a Plateau problem of order $s$ can be reinterpreted as a…
This paper is concerned with approximations and related discretization error estimates for the normal derivatives of solutions of linear elliptic partial differential equations. In order to illustrate the ideas, we consider the Poisson…
We present a novel framework for PDE-constrained $r$-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality…
This paper is concerned with the discretization error analysis of semilinear Neumann boundary control problems in polygonal domains with pointwise inequality constraints on the control. The approximations of the control are piecewise…
In this paper, we analyze the convergence of several discretize-then-optimize algorithms, based on either a second-order or a fourth-order finite difference discretization, for solving elliptic PDE-constrained optimization or optimal…
Several approaches are discussed how to understand the solution of the Dirichlet problem for the Poisson equation when the Dirichlet data are non-smooth such as if they are in $L^2$ only. For the method of transposition (sometimes called…
The purpose of this article is to study the convergence of a low order finite element approximation for a natural convection problem. We prove that the discretization based on P1 polynomials for every variable (velocity, pressure and…
This paper is concerned with finite element error estimates for Neumann boundary control problems posed on convex and polyhedral domains. Different discretization concepts are considered and for each optimal discretization error estimates…
We study finite element approximations of the nonhomogeneous Dirichlet problem for the fractional Laplacian. Our approach is based on weak imposition of the Dirichlet condition and incorporating a nonlocal analogous of the normal derivative…
The biharmonic equation with Dirichlet and Neumann boundary conditions discretized using the mixed finite element method and piecewise linear (with the possible exception of boundary triangles) finite elements on triangular elements has…
In this article we develop convergence theory for a class of goal-oriented adaptive finite element algorithms for second order nonsymmetric linear elliptic equations. In particular, we establish contraction results for a method of this type…
The paper deals with finite element approximations of elliptic Dirichlet boundary control problems posed on two-dimensional polygonal domains. Error estimates are derived for the approximation of the control and the state variables. Special…
The Convex Envelope of a given function was recently characterized as the solution of a fully nonlinear Partial Differential Equation (PDE). In this article we study a modified problem: the Dirichlet problem for the underlying PDE. The main…
This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…
Operator splitting methods combined with finite element spatial discretizations are studied for time-dependent nonlinear Schr\"odinger equations. In particular, the Schr\"odinger-Poisson equation under homogeneous Dirichlet boundary…
We analyze adaptive mesh-refining algorithms for conforming finite element discretizations of certain non-linear second-order partial differential equations. We allow continuous polynomials of arbitrary, but fixed polynomial order. The…
Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…
This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with…
The derivation of second-order ordinary differential equations (ODEs) as continuous-time limits of optimization algorithms has been shown to be an effective tool for the analysis of these algorithms. Additionally, discretizing…