Pages that link to "Item:Q2759070"
From MaRDI portal
The following pages link to Polynomials nonnegative on a grid and discrete optimization (Q2759070):
Displaying 13 items.
- Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- Charges solve the truncated complex moment problem (Q3122073) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- The quintic complex moment problem (Q5216884) (← links)
- Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
