Related papers: Projection in negative norms and the regularizatio…

Let $\Lambda \subset R$ be a strictly increasing sequence. For $r = 1,2$, we give a simple explicit expression for an equivalent norm on the trace spaces $W_p^r(R)|_\Lambda$, $L_p^r(R)|_\Lambda$ of the non-homogeneous and homogeneous…

Regularization is often used in high-dimensional regression settings to generate a sparse model, which can save tremendous computing resources and identify predictors that are most strongly associated with the response. When the predictors…

Projection-based Reduced Order Models minimize the discrete residual of a "full order model" (FOM) while constraining the unknowns to a reduced dimension space. For problems with symmetric positive definite (SPD) Jacobians, this is…

This paper investigates the mathematical properties and numerical approximation of a class of nonlocal elliptic partial differential equations of the form \begin{equation*} -\Delta u + \lambda \, G(u) = f, \end{equation*} where $\Delta$…

The paper deals with a nontrivial density result for $C^m(\overline{\Omega})$ functions, with $m\in{\mathbb N}\cup\{\infty\}$, in the space $$W^{k,\ell,p}(\Omega;\Gamma)= \left\{u\in W^{k,p}(\Omega): u_{|\Gamma}\in…

This paper proposes and develops inexact proximal methods for finding stationary points of the sum of a smooth function and a nonsmooth weakly convex one, where an error is present in the calculation of the proximal mapping of the nonsmooth…

In this paper, we are interested in the periodic homogenization of quasilinear elliptic equations. We obtain error estimates $O(\varepsilon^{1/2})$ for a $C^{1,1}$ domain, and $O(\varepsilon^\sigma)$ for a Lipschitz domain, in which…

This paper presents generalizations of semidefinite programming formulations of 1-norm optimization problems over infinite dictionaries of vectors of complex exponentials, which were recently proposed for superresolution, gridless…

Spectral approximation by polynomials on the unit ball is studied in the frame of the Sobolev spaces $W^{s}_p(\ball)$, $1<p<\infty$. The main results give sharp estimates on the order of approximation by polynomials in the Sobolev spaces…

The Virtual Element Method is well suited to the formulation of arbitrarily regular Galerkin approximations of elliptic partial differential equations of order $2p_1$, for any integer $p_1\geq 1$. In fact, the virtual element paradigm…

We design quasi-interpolation operators based on piecewise polynomial weight functions of degree less than or equal to $p$ that map into the space of continuous piecewise polynomials of degree less than or equal to $p+1$. We show that the…

In this work, we present an abstract error analysis framework for the approximation of linear partial differential equation (PDE) problems in weak formulation. We consider approximation methods in fully discrete formulation, where the…

This paper proposes a universal algorithm for convex minimization problems of the composite form $g_0(x)+h(g_1(x),\dots, g_m(x)) + u(x)$. We allow each $g_j$ to independently range from being nonsmooth Lipschitz to smooth, from convex to…

This work introduces a new cubic regularization method for nonconvex unconstrained multiobjective optimization problems. At each iteration of the method, a model associated with the cubic regularization of each component of the objective…

We consider the classical setting of optimizing a nonsmooth Lipschitz continuous convex function over a convex constraint set, when having access to a (stochastic) first-order oracle (FO) for the function and a projection oracle (PO) for…

This paper is concerned with $\ell_q\,(0<q<1)$-norm regularized minimization problems with a twice continuously differentiable loss function. For this class of nonconvex and nonsmooth composite problems, many algorithms have been proposed…

For the Poisson equation posed in a domain containing a large number of polygonal perforations, we propose a low-dimensional coarse approximation space based on a coarse polygonal partitioning of the domain. Similarly to other multiscale…

Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their…

In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…

This paper studies the Sobolev regularity estimates for weak solutions of a class of degenerate, and singular quasi-linear elliptic problems of the form $\text{div}[\mathbf{A}(x,u, \nabla u)]= \text{div}[\mathbf{F}]$ with non-homogeneous…