Estimating L^ norms by L^2k norms for functions on orbits.

DOI10.1007/S102080010031MaRDI QIDQ1865825zbMATH OpenOpenAlexFDO

Authors Alexander Barvinok

Publication date 2002

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s102080010031

zbMATH Keywords

combinatorial optimization

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Combinatorial optimization (90C27)

Recommendations

• Some optimization problems with extremal operations
• scientific article; zbMATH DE number 1975216
• Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
• Matrix p-norms are NP-hard to approximate if p1,2,
• Approximating the little Grothendieck problem over the orthogonal and unitary groups

Cited in

(13)

• Multihomogeneous nonnegative polynomials and sums of squares
• When a system of real quadratic equations has a solution
• There are significantly more nonnegative polynomials than sums of squares
• A note on polynomial solvability of the CDT problem
• Maximizing Polynomials Subject to Assignment Constraints
• An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
• Approximating nonnegative polynomials via spectral sparsification
• Functional norms, condition numbers and numerical algorithms in algebraic geometry
• Approximate real symmetric tensor rank
• Harmonic Hierarchies for Polynomial Optimization
• Estimating Maximum by Moments for Functions on Orbits
• A random copositive matrix is completely positive with positive probability
• Cross-positive linear maps, positive polynomials and sums of squares

This page was built for publication: Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865825)