On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
From MaRDI portal
Publication:4681650
DOI10.1007/10997703_7zbMath1138.90439OpenAlexW1572246416MaRDI QIDQ4681650
Pablo A. Parrilo, Etienne de Klerk, Monique Laurent
Publication date: 24 June 2005
Published in: Positive Polynomials in Control (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/894d686e-2a57-43b2-b03a-aee0f0d95adc
Related Items
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere, Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone, Certifying the global optimality of quartic minimization over the sphere, On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, A linear programming reformulation of the standard quadratic optimization problem, Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness, Homogenization for polynomial optimization with unbounded sets, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, The truncated moment problem via homogenization and flat extensions, Handelman's hierarchy for the maximum stable set problem, The sum-of-squares hierarchy on the sphere and applications in quantum information theory, An improved semidefinite programming hierarchy for testing entanglement, A PTAS for the minimization of polynomials of fixed degree over the simplex
Uses Software
