scientific article; zbMATH DE number 7201317
From MaRDI portal
Publication:5110197
Publication date: 18 May 2020
Full work available at URL: http://www.heldermann.de/JCA/JCA27/JCA272/jca27031.htm#jca272
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
axial symmetrycross sectioncritical anglesLorentz coneellipsoidal conecone-invariancesemiaxes lengths of an ellipsoidal conevolume of a convex cone
Inequalities and extremum problems involving convexity in convex geometry (52A40) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical angles between two convex cones. II: Special cases
- On the bilinearity rank of a proper cone and Lyapunov-like transformations
- Quadratic optimization over a second-order cone with linear equality constraints
- Axiomatization of the index of pointedness for closed convex cones
- Inradius and circumradius of various convex cones arising in applications
- Bilinear optimality constraints for the cone of positive polynomials
- Centers and partial volumes of convex cones. II: Advanced topics
- On properties of different notions of centers for convex cones
- Searching for critical angles in a convex cone
- Integral invariants of convex cones
- Positive operators on the \(n\)-dimensional ice cream cone
- Computing approximate solutions for convex conic systems of constraints
- Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach
- Ellipsoids are the most symmetric convex bodies
- Solidity indices for convex cones
- Inscribed and circumscribed ellipsoidal cones: volume ratio analysis
- On the irreducibility, Lyapunov rank, and automorphisms of special Bishop-Phelps cones
- Centers and partial volumes of convex cones. I: Basic theory
- Invariant ellipsoidal cones
- Angular analysis of two classes of non-polyhedral convex cones: the point of view of optimization theory
- The primal-dual second-order cone approximations algorithm for symmetric cone programming
- The \(p\)-cones in dimension \(n\geq 3\) are not homogeneous when \(p\neq 2\)
- Measuring solid angles beyond dimension three
- On pairs of vectors achieving the maximal angle of a convex cone
- Condition number and eccentricity of a closed convex cone
- Exponential Nonnegativity on the Ice Cream Cone
- On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
- Invariant cones and stability of linear dynamical systems
- The Relaxation Method for Solving Systems of Linear Inequalities
- Barrier Functions in Interior Point Methods
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Living on the edge: phase transitions in convex programs with random data
- Two characterizations of ellipsoidal cones
- Measuring the degree of pointedness of a closed convex cone: a metric approach
- Some Inequalities for Hypergeometric Functions
- Cross-Positive Matrices
- Minimum Ellipsoids
- Aperture angle analysis for ellipsoids
- Deterministic and stochastic methods for computing volumetric moduli of convex cones
- Conic version of Loewner-John ellipsoid theorem
