相关论文: Volume estimates and their applications in the pro…
We study the problem of finding the Lowner-John ellipsoid, i.e., an ellipsoid with minimum volume that contains a given convex set. We reformulate the problem as a generalized copositive program, and use that reformulation to derive…
We study the problem of finding confidence ellipsoids for an arbitrary distribution in high dimensions. Given samples from a distribution $D$ and a confidence parameter $\alpha$, the goal is to find the smallest volume ellipsoid $E$ which…
In this article, we obtain the order estimates for the Kolmogorov widths of sets with conditions on the norm in the weighted Sobolev space $W^r_{p_1}$ and in the weighted space $L_{p_0}$.
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…
We determine upper asymptotic estimates of Kolmogorov and linear $n$-widths of unit balls in Sobolev and Besov norms in $L_{p}$-spaces on compact Riemannian manifolds. The proofs rely on estimates for the near-diagonal localization of the…
We compute the volumes of convex bodies that are given by inequalities of concave polynomials. These volumes are found to arbitrary precision thanks to the representation of periods by linear differential equations. Our approach rests on…
We consider the problem of learning uncertainty regions for parameter estimation problems. The regions are ellipsoids that minimize the average volumes subject to a prescribed coverage probability. As expected, under the assumption of…
We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex…
In the present paper we improve Besov's recent result about upper estimates for the entropy numbers of Sobolev classes on a H\"{o}lder domain (in the case when the definition of the Sobolev class involves all partial derivatives of order…
In this paper we completely solve the problem of finding the (upper) approximation order with respect to the Kolmogorov, Gel'fand, and linear widths for the embedding of the Sobolev spaces $W^{\alpha,p}$ and $W_{0}^{\alpha,p}$ in the…
We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
We study the recovery of multivariate functions from reproducing kernel Hilbert spaces in the uniform norm. Our main interest is to obtain preasymptotic estimates for the corresponding sampling numbers. We obtain results in terms of the…
In this note, we estimate the upper bound of volume of closed positively or nonnegatively curved Alexandrov space $X$ with strictly convex boundary. We also discuss the equality case. In particular, the Boundary Conjecture holds when the…
We study the asymptotic behaviour of the approximation, Gelfand and Kolmogorov numbers of the compact embeddings of weighted function spaces of Besov and Triebel-Lizorkin type in the case where the weights belong to a large class. We obtain…
We consider the problem of estimating the volume of a compact domain in a Euclidean space based on a uniform sample from the domain. We assume the domain has a boundary with positive reach. We propose a data splitting approach to correct…
Reduced model spaces, such as reduced basis and polynomial chaos, are linear spaces $V_n$ of finite dimension $n$ which are designed for the efficient approximation of families parametrized PDEs in a Hilbert space $V$. The manifold…
Our focus is on robust recovery algorithms in statistical linear inverse problem. We consider two recovery routines - the much studied linear estimate originating from Kuks and Olman [42] and polyhedral estimate introduced in [37]. It was…
We give upper bounds for volume of sublevel sets of real polynomials. Our method is to combine a version of global Lojasiewicz inequality with some well known estimate on volume of tubes around real algebraic sets. Some applications to…
In this article, we generalize the definition of the probabilistic Gel'fand width from the Hilbert space to the strictly convex reflexive space by giving Birkhoff left orthogonal decomposition theorem. Meanwhile, a more natural definition…