Polynomials nonnegative on a grid and discrete optimization
From MaRDI portal
Publication:2759070
DOI10.1090/S0002-9947-01-02898-7zbMath1052.90064OpenAlexW1698110770MaRDI QIDQ2759070
Publication date: 10 December 2001
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-01-02898-7
Related Items
Semidefinite representations for finite varieties, Semidefinite relaxations of dynamical programs under discrete constraints, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, On solving biquadratic optimization via semidefinite relaxation, Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations, Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz, Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz, Exact relaxations of non-convex variational problems, Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra, The quintic complex moment problem, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Charges solve the truncated complex moment problem, Polyhedra related to integer-convex polynomial systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(K\)-moment problem for compact semi-algebraic sets
- The classical moment problem as a self-adjoint finite difference operator
- Global Optimization with Polynomials and the Problem of Moments
- Distinguished representations of strictly positive polynomials
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Semidefinite Programming
- The truncated complex $K$-moment problem
