Related papers: Superresolution of principal semi-algebraic sets
In this paper, we analyze two classes of spectral volume (SV) methods for one-dimensional hyperbolic equations with degenerate variable coefficients. The two classes of SV methods are constructed by letting a piecewise $k$-th order ($k\ge…
We prove a priori H\"older bounds for continuous solutions to degenerate equations with variable coefficients of type $$ \mathrm{div}\left(u^2 A\nabla w\right)=0\quad\mathrm{in \ }\Omega\subset\mathbb R^n,\qquad \mbox{with}\qquad…
For general quadratically-constrained quadratic programming (QCQP), we propose a parabolic relaxation described with convex quadratic constraints. An interesting property of the parabolic relaxation is that the original non-convex feasible…
The formal structure of the early Einstein's Special Relativity follows the axiomatic deductive method of Euclidean geometry. In this paper we show the deep-rooted relation between Euclidean and space-time geometries that are both linked to…
We consider the conic linear program given by a closed convex cone in an Euclidean space and a matrix, where vector on the right-hand-side of the constraint system and the vector defining the objective function are subject to change. Using…
We prove homogenization for degenerate viscous Hamilton-Jacobi equations in dimension one in stationary ergodic environments with a quasiconvex and superlinear Hamiltonian of fairly general type. We furthermore show that the effective…
Let V be a semialgebraic set parameterized by quadratic polynomials over a quadratic set T. This paper studies semidefinite representation of its convex hull by projections of spectrahedra (defined by linear matrix inequalities). When T is…
We construct differential algebras in which spaces of (one-dimensional) periodic ultradistributions are embedded. By proving a Schwartz impossibility type result, we show that our embeddings are optimal in the sense of being consistent with…
At the two-derivative order, the group manifold reduction of heterotic supergravity on $S^3$ results in a half-maximal 7D gauged supergravity coupled to three vector multiplets, and a further truncation can be taken to remove the vector…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We prove that strong finite total curvature complete hypersurfaces of (n+1)-euclidean space are proper and diffeomorphic to a compact manifold minus finitely many points. With an additional condition, we also prove that the Gauss map of…
We review the special geometry of N = 2 supersymmetric vector and hypermultiplets with emphasis on recent developments and applications. A new formulation of the local c-map based on the Hesse potential and special real coordinates is…
We show how to construct seven-dimensional half-maximally supersymmetric consistent truncations of 11-/10-dimensional SUGRA using $\mathrm{SL}(5)$ exceptional field theory. Such truncations are defined on generalised…
In this paper, a semi-discrete spatial finite volume (FV) method is proposed and analyzed for approximating solutions of anomalous subdiffusion equations involving a temporal fractional derivative of order $\alpha \in (0,1)$ in a…
We consider the set of extremal points of the generalized unit ball induced by gradient total variation seminorms for vector-valued functions on bounded Euclidean domains. These are central to the understanding of sparse solutions and…
The semidiscretization of a sound soft scattering problem modelled by the wave equation is analyzed. The spatial treatment is done by integral equation methods. Two temporal discretizations based on Runge-Kutta convolution quadrature are…
We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…
Globally optimizing a nonconvex quadratic over the intersection of $m$ balls in $\mathbb{R}^n$ is known to be polynomial-time solvable for fixed $m$. Moreover, when $m=1$, the standard semidefinite relaxation is exact. When $m=2$, it has…
Given a Hilbert space $\mathcal H$ and a finite measure space $\Omega$, the approximation of a vector-valued function $f: \Omega \to \mathcal H$ by a $k$-dimensional subspace $\mathcal U \subset \mathcal H$ plays an important role in…
We study the convergence rate of moment-sum-of-squares hierarchies of semidefinite programs for optimal control problems with polynomial data. It is known that these hierarchies generate polynomial under-approximations to the value function…