Skip to main content
Log in

Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace

  • Published:
Foundations of Computational Mathematics Aims and scope Submit manuscript

Abstract

We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in ℝn and related problems of complex integration and optimization of a polynomial on the unit sphere. We identify a class of n-variate polynomials f for which the integral of any positive integer power fp over the whole space is well approximated by a properly scaled integral over a random subspace of dimension O(log n). Consequently, the maximum of f on the unit sphere is well approximated by a properly scaled maximum on the unit sphere in a random subspace of dimension O(log n). We discuss connections with problems of combinatorial counting and applications to efficient approximation of a hafnian of a positive matrix.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Barvinok.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barvinok, A. Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace. Found Comput Math 7, 229–244 (2007). https://doi.org/10.1007/s10208-005-0178-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10208-005-0178-x

Navigation