Probability Bounds for Polynomial Functions in Random Variables

DOI10.1287/moor.2013.0637zbMath1314.60066OpenAlexW2130832427MaRDI QIDQ5244874

Zhening Li, Bo Jiang, Simai He, Shu-Zhong Zhang

Publication date: 31 March 2015

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2013.0637

zbMATH Keywords

approximation algorithmpolynomial functionrandom samplingpolynomial optimizationprobability boundtensor form

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Multilinear algebra, tensor calculus (15A69)

Related Items (14)

On the Ball-Constrained Weighted Maximin Dispersion Problem ⋮ Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems ⋮ A note on semidefinite programming relaxations for polynomial optimization over a single sphere ⋮ On approximation algorithm for orthogonal low-rank tensor approximation ⋮ Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors ⋮ On norm compression inequalities for partitioned block tensors ⋮ Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors ⋮ Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual ⋮ Approximation algorithms for optimization of real-valued general conjugate complex forms ⋮ A hybrid second-order method for homogenous polynomial optimization over unit sphere ⋮ Approximation methods for complex polynomial optimization ⋮ On the tensor spectral \(p\)-norm and its dual norm via partitions ⋮ Bounds on the Spectral Norm and the Nuclear Norm of a Tensor Based on Tensor Partitions ⋮ Hardness and Approximation Results for L_p-Ball Constrained Homogeneous Polynomial Optimization Problems

Cites Work

• Unnamed Item
• Approximation algorithms for discrete polynomial optimization
• A counter-example to a conjecture of Ben-Tal, Nemirovski and Roos
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Moment inequalities for sums of random matrices and their applications in optimization
• Partitions of mass-distributions and of convex bodies by hyperplanes
• Adaptive estimation of a quadratic functional by model selection.
• A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
• Bounding Probability of Small Deviation: A Fourth Moment Approach
• Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
• Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite relaxation and nonconvex quadratic optimization
• Deterministic and randomized polynomial‐time approximation of radii
• Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
• Approximation Methods for Polynomial Optimization
• Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
• Approximating the Cut-Norm via Grothendieck's Inequality

This page was built for publication: Probability Bounds for Polynomial Functions in Random Variables