8,756 research outputs found
Intrinsic Volumes of Polyhedral Cones: A combinatorial perspective
The theory of intrinsic volumes of convex cones has recently found striking
applications in areas such as convex optimization and compressive sensing. This
article provides a self-contained account of the combinatorial theory of
intrinsic volumes for polyhedral cones. Direct derivations of the General
Steiner formula, the conic analogues of the Brianchon-Gram-Euler and the
Gauss-Bonnet relations, and the Principal Kinematic Formula are given. In
addition, a connection between the characteristic polynomial of a hyperplane
arrangement and the intrinsic volumes of the regions of the arrangement, due to
Klivans and Swartz, is generalized and some applications are presented.Comment: Survey, 23 page
Gordon's inequality and condition numbers in conic optimization
The probabilistic analysis of condition numbers has traditionally been
approached from different angles; one is based on Smale's program in complexity
theory and features integral geometry, while the other is motivated by
geometric functional analysis and makes use of the theory of Gaussian
processes. In this note we explore connections between the two approaches in
the context of the biconic homogeneous feasiblity problem and the condition
numbers motivated by conic optimization theory. Key tools in the analysis are
Slepian's and Gordon's comparision inequalities for Gaussian processes,
interpreted as monotonicity properties of moment functionals, and their
interplay with ideas from conic integral geometry
Commensurate Nb2Zr5O15: Accessible Within the Field Nb2ZrxO2x+5 After All
Doped niobium zirconium oxides are applied in field-effect transistors and as special-purpose coatings. Whereas their material properties are sufficiently known, their crystal structures remain widely uncharacterized. Herein, we report on the comparably mild sol–gel synthesis of Nb2Zr5O15 and the elucidation of its commensurately modulated structure via neutron diffraction. We describe the structure using the most appropriate superspace as well as the convenient supercell approach. It is part of an α-PbO2-homeotypic field with the formula Nb2ZrxO2x+5, which has previously been reported only for x ≥ 5.1, and is closely related to the structure of Hf3Ta2O11. The results, supported by X-ray diffraction and additional synthesis experiments, are contextualized within the existing literature. Via the sol–gel route, metastable Nb–Zr–O compounds and their heavier congeners are accessible that shed light on possible structures of these commercially utilized materials.DFG, 198634447, SPP 1613: Regenerativ erzeugte Brennstoffe durch lichtgetriebene Wasserspaltung: Aufklärung der Elementarprozesse und Umsetzungsperspektiven auf technologische KonzepteTU Berlin, Open-Access-Mittel - 201
Recommended from our members
Data structures for retrieval on integer grids
A family of data structures is presented for retrieval of the sum of values of points within a half-plane or polygon, given that the points are on integer coordinates in the plane. Fredman has shown that the problem has a lower bound of Ω(N^2/3) for intermixed updates and retrievals. Willard has shown an upper bound of O(N^2log6^4) for the case where the points are not restricted to integer coordinates.We have developed families of related data structures for retrievals of half-planes or polygons. One of the data structures permits intermixed updates and half-plane retrievals in O(N^2/3log N) time, where N is the size of the grid.We use a technique we call "Rotation" to permit a better match of a portion of the data structure to the particular problem. Rotations appear to be an effective method for trading-off storage redundancy against retrieval time for certain classes of problems
Effective Condition Number Bounds for Convex Regularization
We derive bounds relating Renegar's condition number to quantities that
govern the statistical performance of convex regularization in settings that
include the -analysis setting. Using results from conic integral
geometry, we show that the bounds can be made to depend only on a random
projection, or restriction, of the analysis operator to a lower dimensional
space, and can still be effective if these operators are ill-conditioned. As an
application, we get new bounds for the undersampling phase transition of
composite convex regularizers. Key tools in the analysis are Slepian's
inequality and the kinematic formula from integral geometry.Comment: 17 pages, 4 figures . arXiv admin note: text overlap with
arXiv:1408.301
Fast Convex Decomposition for Truthful Social Welfare Approximation
Approximating the optimal social welfare while preserving truthfulness is a
well studied problem in algorithmic mechanism design. Assuming that the social
welfare of a given mechanism design problem can be optimized by an integer
program whose integrality gap is at most , Lavi and Swamy~\cite{Lavi11}
propose a general approach to designing a randomized -approximation
mechanism which is truthful in expectation. Their method is based on
decomposing an optimal solution for the relaxed linear program into a convex
combination of integer solutions. Unfortunately, Lavi and Swamy's decomposition
technique relies heavily on the ellipsoid method, which is notorious for its
poor practical performance. To overcome this problem, we present an alternative
decomposition technique which yields an approximation
and only requires a quadratic number of calls to an integrality gap verifier
VALUING WILDLIFE FOR EFFICIENT MULTIPLE USE: ELK VERSUS CATTLE
A restructuring of current theoretical and empirical research efforts is required if valuation estimates are to be of use in multiple-use policy making, a restructuring that focuses on the impact of recreation quality on recreation benefits and efficient wildlife herd sizes. The argument is illustrated for cattle production and elk management on public lands.Livestock Production/Industries, Resource /Energy Economics and Policy,
- …