Polynomials nonnegative on a grid and discrete optimization
By Jean B. Lasserre. 2001
57 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/3929d12cf9ca9634a02c8848cf521c7085090020
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Jean B. Lasserre
- L. Fialkow
- Didier Henrion
- R. Curto
- Adam N. Letchford
- Monique Laurent
- S. Burer
- Jiawang Nie
In Computer Graphics and Computer-Aided Design
In Numerical Analysis
- Didier Henrion
- Adam N. Letchford
- L. Fialkow
- S. Burer
- R. Curto
- Jean B. Lasserre
- Jiawang Nie
- Monique Laurent
Citations in the corpus
- Detecting global optimality and extracting solutions in GloptiPoly (2003, background): “For more details the interested reader is referred to [13, 14, 15, 17].”
- Truncated K-moment problems in several variables (2005, background): “ber of real or complex variables. In [Las1], Lasserre developed applications of [CuFi4, Theorem 1.6] to optimization problems in the plane. These applications also extend to RN (N >2) (cf. [Las1], [Las2], [Las3]), but they require the above mentioned generalization of [CuFi4, Theorem 1.6] that we”
- Non-convex mixed-integer nonlinear programming: A survey (2012, methodology): “The method of Lasserre [78] works for integer polynomial programs when each variable has an explicit lower and upper bound.”