Related references
Note: Only part of the references are listed.GloptiPoly 3: moments, optimization and semidefinite programming
Didier Henrion et al.
OPTIMIZATION METHODS & SOFTWARE (2009)
Is Gauss quadrature better than Clenshaw-Curtis?
Lloyd N. Trefethen
SIAM REVIEW (2008)
A semidefinite programming approach to the generalized problem of moments
Jean B. Lasserre
MATHEMATICAL PROGRAMMING (2008)
Sufficient conditions for a real polynomial to be a sum of squares
Jean B. Lasserre
ARCHIV DER MATHEMATIK (2007)
Optimization of polynomials on compact semialgebraic sets
M Schweighofer
SIAM JOURNAL ON OPTIMIZATION (2005)
SDP vs. LP relaxations for the moment approach in some performance evaluation problems
JB Lasserre et al.
STOCHASTIC MODELS (2004)
An extension of MATLAB to continuous functions and operators
Z Battles et al.
SIAM JOURNAL ON SCIENTIFIC COMPUTING (2004)
Semidefinite programming vs. LP relaxations for polynomial programming
JB Lasserre
MATHEMATICS OF OPERATIONS RESEARCH (2002)
A Laplace transform algorithm for the volume of a convex polytope
JB Lasserre et al.
JOURNAL OF THE ACM (2001)
Global optimization with polynomials and the problem of moments
JB Lasserre
SIAM JOURNAL ON OPTIMIZATION (2001)
Slow hit-and-run sampling
C Bélisle
STATISTICS & PROBABILITY LETTERS (2000)
Share Paper
