Intrinsic volumes of symmetric cones and applications in convex programming
From MaRDI portal
Publication:2515035
The authors consider convex cone problems (including reference cones such as the positive orthant, Lorentz cone and the cone of symmetric positive semidefinite matrices) and their generic behaviour by using the notations of intrinsic volumes and curvature measures. Probalistic analysis of random convex problems is evaluated and explicit formulas for the curvature measures of semi-definite cones at strata of the same rank are presented.
Recommendations
- Intrinsic volumes of polyhedral cones: a combinatorial perspective
- Cone volume functionals and affine inequalities
- Intrinsic and dual volume deviations of convex bodies and polytopes
- Extremum problems for the cone volume functional of convex polytopes
- Concentration of the intrinsic volumes of a convex body
- From Steiner formulas for cones to concentration of intrinsic volumes
- Volume approximation of convex bodies by inscribed polytopes
- Volume inequalities using sections of convex sets
- Inequalities between successive minima and intrinsic volumes of a convex body
- Approximation of convex bodies by inscribed simplices of maximum volume
Cites work
- A general formula for the algebraic degree in semidefinite programming
- A mathematical view of interior-point methods in convex optimization
- A Problem in Geometric Probability.
- Barrier Functions in Interior Point Methods
- Complementarity and nondegeneracy in semidefinite programming
- Curvature measures and Steiner formulae in space forms
- Euclidean Jordan algebras and interior-point algorithms
- scientific article; zbMATH DE number 3824602 (Why is no real title available?)
- scientific article; zbMATH DE number 3686283 (Why is no real title available?)
- scientific article; zbMATH DE number 3705455 (Why is no real title available?)
- scientific article; zbMATH DE number 51906 (Why is no real title available?)
- scientific article; zbMATH DE number 52737 (Why is no real title available?)
- scientific article; zbMATH DE number 3627912 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 2174437 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 873911 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- Intrinsic volumes of symmetric cones and applications in convex programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- On Parallel Hypersurfaces in the Elliptic and Hyperbolic n-Dimensional Space
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Probabilistic analysis of the Grassmann condition number
- Quaternions and matrices of quaternions
- Random Fields and Geometry
- Random polytopes: Their definition, generation and aggregate properties
- Self-scaled barrier functions on symmetric cones and their classification
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Smallest singular value of a random rectangular matrix
- Smooth analysis of the condition number and the least singular value
- Solving linear programs with finite precision. I: Condition numbers and random programs
- Steiner’s formulae on a general 𝑆ⁿ⁺¹
- Stochastic and Integral Geometry
- The algebraic degree of semidefinite programming
- The importance of the Selberg integral
- The kinematic formula in Riemannian homogeneous spaces
- Über die Steinersche Formel für Parallelflächen
Cited in
(20)- Conic support measures
- Faces in random great hypersphere tessellations
- Sensitivity of low-rank matrix recovery
- Conic intrinsic volumes of Weyl chambers
- Probabilistic analysis of the Grassmann condition number
- Intrinsic volumes of polyhedral cones: a combinatorial perspective
- Intrinsic volumes of symmetric cones and applications in convex programming
- Random conical tessellations
- Maximum-Volume Symmetric Gauge Ball Problem on the Convex Cone of Positive Definite Matrices and Convexity of Optimal Sets
- Random positive operator valued measures
- Sharp recovery bounds for convex demixing, with applications
- A lower bound on the positive semidefinite rank of convex bodies
- Symmetry adapted Gram spectrahedra
- A new approach to weak convergence of random cones and polytopes
- scientific article; zbMATH DE number 7236423 (Why is no real title available?)
- Generic Spectrahedral Shadows
- Deterministic and stochastic methods for computing volumetric moduli of convex cones
- Intersection probabilities and kinematic formulas for polyhedral cones
- Gaussian random projections of convex cones: approximate kinematic formulae and applications
- From Steiner formulas for cones to concentration of intrinsic volumes
This page was built for publication: Intrinsic volumes of symmetric cones and applications in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515035)
