Related papers: The planar Least Gradient problem in convex domain…
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for: * high-dimensional…
We consider the problem of minimizing convex combinations of the first two eigenvalues of the Dirichlet-Laplacian among open sets of $R^N$ of fixed measure. We show that, by purely elementary arguments, based on the minimality condition, it…
We construct least squares formulations of PDEs with inhomogeneous essential boundary conditions, where boundary residuals are not measured in unpractical fractional Sobolev norms, but which formulations nevertheless are shown to yield a…
The analysis of incomplete contingency tables is an important problem, which is also of practical interest. In this paper, we consider boundary solutions under nonignorable nonresponse models in two-way incomplete tables with data on both…
A property of smooth convex domains $\Omega \subset \mathbb{R}^n$ is that if two points on the boundary $x, y \in \partial \Omega$ are close to each other, then their normal vectors $n(x), n(y)$ point roughly in the same direction and this…
In this work we study the existence of solutions to the following critical fractional problem with concave-convex nonlinearities, \begin{equation*} \left \{ \begin{array}{l} (-\Delta)^su=\lambda u^q+u^{2_s^*-1},\ u>0\quad\text{in…
In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index…
Higher regularity estimate has been a challenging question for the Boltzmann equation in bounded domains. Indeed, it is well-known to have "the non-existence of a second order derivative at the boundary" in [15] even for symmetric convex…
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…
We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches,…
We study the minimization of convex, variational integrals of linear growth among all functions in the Sobolev space $W^{1,1}$ with prescribed boundary values (or its equivalent formulation as a boundary value problem for a degenerately…
Policy gradients methods apply to complex, poorly understood, control problems by performing stochastic gradient descent over a parameterized class of polices. Unfortunately, even for simple control problems solvable by standard dynamic…
The gradient of any local minimiser of functionals of the type $$ w \mapsto \int_\Omega f(x,w,Dw)\,dx+\int_\Omega w\mu\,dx, $$ where $f$ has $p$-growth, $p>1$, and $\Omega \subset \mathbb R^n$, is continuous provided the optimal Lorentz…
We study the existence of sign-changing multiple interior spike solutions for the following Dirichlet problem {equation*}\e^2\Delta v-v+f(v)=0\hbox{in}\Omega,\quad v=0 \hbox{on}\partial \Omega,{equation*} where $\Omega $ is a smooth and…
Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the…
For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function $f$ such that if the tree-width of a graph $G$ with $k$ pairs of terminals is at least $f(k)$, then $G$ contains a…
The pole condition approach for deriving transparent boundary conditions is extended to the time-dependent, two-dimensional case. Non-physical modes of the solution are identified by the position of poles of the solution's spatial Laplace…
In this paper, we derive the pointwise upper bounds and lower bounds on the gradients of solutions to the Lam\'{e} systems with partially infinite coefficients as the surface of discontinuity of the coefficients of the system is located…
This article derives lower bounds on the convergence rate of continuous-time gradient-based optimization algorithms. The algorithms are subjected to a time-normalization constraint that avoids a reparametrization of time in order to make…