Related papers: Optimal Time-Adaptivity for Parabolic Problems wit…
In this paper, we derive a novel recovery type a posteriori error estimation of the Crank-Nicolson finite element method for the Cahn--Hilliard equation. To achieve this, we employ both the elliptic reconstruction technique and a time…
We unify and extend the semigroup and the PDE approaches to stochastic maximal regularity of time-dependent semilinear parabolic problems with noise given by a cylindrical Brownian motion. We treat random coefficients that are only…
We extend the ideas of Diening, Kreuzer, and Stevenson [Instance optimality of the adaptive maximum strategy, Found. Comput. Math. (2015)], from conforming approximations of the Poisson problem to nonconforming Crouzeix-Raviart…
The mesh flexibility offered by the virtual element method through the permission of arbitrary element geometries, and the seamless incorporation of `hanging' nodes, has made the method increasingly attractive in the context of adaptive…
In this paper we consider a parabolic optimal control problem with a Dirac type control with moving point source in two space dimensions. We discretize the problem with piecewise constant functions in time and continuous piecewise linear…
This paper presents a Crank-Nicolson leap-frog (CNLF) scheme for the unsteady incompressible magnetohydrodynamics (MHD) equations. The spatial discretization adopts the Galerkin finite element method (FEM), and the temporal discretization…
This paper aims to develop an efficient adaptive finite element method for the second-order elliptic problem. Although the theory for adaptive finite element methods based on residual-type a posteriori error estimator and bisection…
In a recent work, we analyzed a weighted-residual error estimator for isogeometric boundary element methods in 2D and proposed an adaptive algorithm which steers the local mesh-refinement of the underlying partition as well as the…
In this paper we characterize sharp time-data tradeoffs for optimization problems used for solving linear inverse problems. We focus on the minimization of a least-squares objective subject to a constraint defined as the sub-level set of a…
Implicit schemes have been extensively used in building physics to compute the solution of moisture diffusion problems in porous materials for improving stability conditions. Nevertheless, these schemes require important sub-iterations when…
Model Predictive Control (MPC) is a well-established approach to solve infinite horizon optimal control problems. Since optimization over an infinite time horizon is generally infeasible, MPC determines a suboptimal feedback control by…
This paper proposes an adaptive hyper-reduction method to reduce the computational cost associated with the simulation of parametric particle-based kinetic plasma models, specifically focusing on the Vlasov-Poisson equation. Conventional…
We consider the problem of maximizing the multilinear extension of a submodular function subject a single matroid constraint or multiple packing constraints with a small number of adaptive rounds of evaluation queries. We obtain the first…
We consider a 1D periodic atomistic model, for which we formulate and analyze an adaptive variant of a quasicontinuum method. We establish a posteriori error estimates for the energy norm and for the energy, based on a posteriori residual…
We analyze optimal complexity of adaptive finite element methods (AFEMs) for general second-order linear elliptic partial differential equations (PDEs) in the Lax-Milgram setting. To this end, we formulate an adaptive algorithm which steers…
In this contribution, we generalize the concept of \textit{optimally accurate operators} proposed and used in a series of studies on the simulation of seismic wave propagation, particularly based on Geller \& Takeuchi (1995). Although these…
A novel decomposition scheme to solve parametric non-convex programs as they arise in Nonlinear Model Predictive Control (NMPC) is presented. It consists of a fixed number of alternating proximal gradient steps and a dual update per time…
We study convergence rates of the classic proximal bundle method for a variety of nonsmooth convex optimization problems. We show that, without any modification, this algorithm adapts to converge faster in the presence of smoothness or a…
The paper is devoted to the study of a new class of optimal control problems for nonsmooth dynamical systems governed by nonconvex discontinuous differential inclusions of the sweeping type with involving variable time into optimization. We…
This work concentrates on a class of optimal control problems for semilinear parabolic equations subject to control constraint of the form $\|u(t)\|_{L^1(\Omega)} \le \gamma$ for $t \in (0,T)$. This limits the total control that can be…