Integration and optimization of multivariate polynomials by restriction onto a random subspace
From MaRDI portal
Publication:2462620
DOI10.1007/s10208-005-0178-xzbMath1132.68069arXivmath/0502298OpenAlexW2145030496MaRDI QIDQ2462620
Publication date: 3 December 2007
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0502298
Geometric probability and stochastic geometry (60D05) Nonconvex programming, global optimization (90C26) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
Maximizing products of linear forms, and the permanent of positive semidefinite matrices ⋮ Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ Optimization on the Euclidean Unit Sphere ⋮ Testing the nullspace property using semidefinite programming ⋮ Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems ⋮ The complexity of optimizing over a simplex, hypercube or sphere: a short survey ⋮ On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries ⋮ Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems