Real ideal and the duality of semidefinite programming for polynomial optimization

DOI10.1007/S13160-013-0104-6zbMath1328.14092arXiv0901.2998OpenAlexW1979692659MaRDI QIDQ351462

Hayato Waki, Tomoyuki Takenawa, Yoshiyuki Sekiguchi

Publication date: 11 July 2013

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.2998

zbMATH Keywords

polynomial optimizationreal idealsemidefinite programming relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Real algebraic sets (14P05) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Semialgebraic sets and related spaces (14P10)

Related Items (3)

Computing real radicals and \(S\)-radicals of polynomial systems ⋮ Real Radicals and Finite Convergence of Polynomial Optimization Problems ⋮ Computing real radicals by moment optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A zero-dimensional approach to compute real radicals
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Semidefinite programming relaxations for semialgebraic problems
• Local reality on algebraic varieties
• Global Optimization with Polynomials and the Problem of Moments
• EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
• Optimization of Polynomial Functions
• Optimization of Polynomials on Compact Semialgebraic Sets
• Algorithms in real algebraic geometry

This page was built for publication: Real ideal and the duality of semidefinite programming for polynomial optimization