Related papers: Variational problems with gradient constraints: $\…
Deep learning has shown successful application in visual recognition and certain artificial intelligence tasks. Deep learning is also considered as a powerful tool with high flexibility to approximate functions. In the present work,…
This work is aimed at the derivation of reliable and efficient a posteriori error estimates for convection-dominated diffusion problems motivated by a linear Fokker-Planck problem appearing in computational neuroscience. We obtain…
In this paper, we exploit the so-called value function reformulation of the bilevel optimization problem to develop duality results for the problem. Our approach builds on Fenchel-Lagrange-type duality to establish suitable results for the…
We develop all of the components needed to construct an adaptive finite element code that can be used to approximate fractional partial differential equations, on non-trivial domains in $d\geq 1$ dimensions. Our main approach consists of…
We propose and analyze a posteriori error estimators for an optimal control problem that involves an elliptic partial differential equation as state equation and a control variable that enters the state equation as a coefficient; pointwise…
We consider a primal-dual algorithm for minimizing $f(x)+h\square l(Ax)$ with Fr\'echet differentiable $f$ and $l^*$. This primal-dual algorithm has two names in literature: Primal-Dual Fixed-Point algorithm based on the Proximity Operator…
Using the tools of optimal control, semiconvex duality and \maxp algebra, this work derives a unifying representation of the solution for the matrix differential Riccati equation (DRE) with time-varying coefficients. It is based upon a…
We consider Poisson's equation with a finite number of weighted Dirac masses as a source term, together with its discretization by means of conforming finite elements. For the error in fractional Sobolev spaces, we propose residual-type a…
Under some regularity assumptions, we report an a priori error analysis of a dG scheme for the Poisson and Stokes flow problem in their dual mixed formulation. Both formulations satisfy a Babu\v{s}ka-Brezzi type condition within the space…
We provide an analysis of the least gradient problem in the case when the boundary datum is only imposed on a part of the boundary. First, we give a characterisation of solutions in a general setting using convex duality theory. Then, we…
The main aim of this article is to analyze mixed finite element method for the second order Dirichlet boundary control problem. Therein, we develop both a priori and a posteriori error analysis using the energy space based approach. We…
We study geometric duality for convex vector optimization problems. For a primal problem with a $q$-dimensional objective space, we formulate a dual problem with a $(q+1)$-dimensional objective space. Consequently, different from an…
In this paper, we consider the dual formulation of minimizing $\sum_{i\in I}f_i(x_i)+\sum_{j\in J} g_j(\mathcal{A}_jx)$ with the index sets $I$ and $J$ being large. To address the difficulties from the high dimension of the variable $x$…
A posteriori error estimators for the symmetric mixed finite element methods for linear elasticity problems of Dirichlet and mixed boundary conditions are proposed. Stability and efficiency of the estimators are proved. Finally, we provide…
This paper studies the primal-dual convergence and iteration-complexity of proximal bundle methods for solving nonsmooth problems with convex structures. More specifically, we develop a family of primal-dual proximal bundle methods for…
A posteriori estimates for mixed finite element discretizations of the Navier-Stokes equations are derived. We show that the task of estimating the error in the evolutionary Navier-Stokes equations can be reduced to the estimation of the…
We show that the primal-dual gradient method, also known as the gradient descent ascent method, for solving convex-concave minimax problems can be viewed as an inexact gradient method applied to the primal problem. The gradient, whose exact…
We propose, analyze, and test a proximal-gradient method for solving regularized optimization problems with general constraints. The method employs a decomposition strategy to compute trial steps and uses a merit function to determine step…
In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to…
We explore the covariance of error terms coming from Weyl's conjecture regarding the number of Dirichlet eigenvalues up to size $X$. We also consider this problem in short intervals, i.e. the error term of the number of eigenvalues in the…