Efficient sampling in spectrahedra and volume approximation
type: Item
instance of: scholarly article
title: Efficient sampling in spectrahedra and volume approximation
zbMATH Open document ID: 1489.90105
author: Apostolos Chalkis
author: Ioannis Z. Emiris
author: Vissarion Fisikopoulos
author: Panagiotis Repouskos
author: Elias P. Tsigaridas
published in: Linear Algebra and its Applications
publication date: 2022-06-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/2010.03817
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 65H17
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 65D99
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 7535508
zbMATH Keywords: spectahedron
zbMATH Keywords: semidefinite-programming
zbMATH Keywords: sampling
zbMATH Keywords: random walk
zbMATH Keywords: Monte Carlo
zbMATH Keywords: polynomial eigenvalue problem
zbMATH Keywords: volume approximation
zbMATH Keywords: optimization
Wikidata QID: Q114151654
describes a project that uses: tmg
describes a project that uses: VolEsti
describes a project that uses: Spectra
describes a project that uses: Eigen
describes a project that uses: Billiard walk
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4225384330
arXiv ID: 2010.03817
cites work: The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
cites work: Semidefinite Optimization and Convex Algebraic Geometry
cites work: A survey of computational complexity results in systems and control
cites work: Random Spectrahedra
cites work: Condition
cites work: Q4518985
cites work: Sampling the feasible sets of SDPs and volume approximation
cites work: Bypassing KLS
cites work: A practical volume algorithm
cites work: A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
cites work: Perturbation theory for homogeneous polynomial eigenvalue problems
cites work: A random polynomial-time algorithm for approximating the volume of convex bodies
cites work: Practical Polytope Volume Approximation
cites work: Separation bounds for polynomial systems
cites work: The nonlinear eigenvalue problem
cites work: Approximate Volume and Integration for Basic Semialgebraic Sets
cites work: Symmetric Linearizations for Matrix Polynomials
cites work: Simulated Annealing for Convex Optimization
cites work: On the complexity of computing determinants
cites work: Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
cites work: Computing the Volume of Compact Semi-Algebraic Sets
cites work: On the complexity of the Lickteig-Roy subresultant algorithm
cites work: Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
cites work: Sylvester-Habicht sequences and fast Cauchy index computation
cites work: Random walks and anO*(n5) volume algorithm for convex bodies
cites work: Vector Spaces of Linearizations for Matrix Polynomials
cites work: Q4231779
cites work: Deterministic computation of the characteristic polynomial in the time of matrix multiplication
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Nearly optimal refinement of real roots of a univariate polynomial
cites work: The \(D\)-decomposition technique for linear matrix inequalities
cites work: A Monte Carlo approach to the analysis of control system robustness
cites work: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
cites work: Q5708384
cites work: Q4337625
cites work: Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems
cites work: Q5290281
cites work: Efficient estimation of covariance selection models
cites work: Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
DOI: 10.1016/J.LAA.2022.04.002
Recommended article: Efficient Random-Walk Methods for Approximating Polytope Volume
Recommended article: Q4789202
Recommended article: Sampling and approximation of bandlimited volumetric data

Efficient sampling in spectrahedra and volume approximation (Recommended article)
Recommended article: A fast direct sampling algorithm for equilateral closed polygons
Similarity Score: 0.87488204
Recommender Run: Recommender Run 3

Efficient sampling in spectrahedra and volume approximation (Recommended article)
Recommended article: Q5442590
Similarity Score: 0.87486
Recommender Run: Recommender Run 3

Efficient sampling in spectrahedra and volume approximation (Recommended article)
Recommended article: Efficient numerical methods in non-uniform sampling theory
Similarity Score: 0.87457496
Recommender Run: Recommender Run 3

Efficient sampling in spectrahedra and volume approximation (Recommended article)
Recommended article: An Optimal-Dimensionality Sampling Scheme on the Sphere With Fast Spherical Harmonic Transforms
Similarity Score: 0.8734864
Recommender Run: Recommender Run 3

Efficient sampling in spectrahedra and volume approximation (Recommended article)
Recommended article: Q4558208
Similarity Score: 0.8728833
Recommender Run: Recommender Run 3

Efficient sampling in spectrahedra and volume approximation (Recommended article)
Recommended article: Non-parametric Sampling Approximation via Voronoi Tessellations
Similarity Score: 0.8725204
Recommender Run: Recommender Run 3