TSSOS

swMATH36859MaRDI QIDQ52561FDOQ52561

Author name not available (Why is that?)

Source code repository: https://github.com/wangjie212/TSSOS

Cited In (24)

• Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
• Nonnegative Polynomials and Circuit Polynomials
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• Symmetry reduction in AM/GM-based optimization
• Bounding the separable rank via polynomial optimization
• Algebraic Perspectives on Signomial Optimization
• Minimizing rational functions: a hierarchy of approximations via pushforward measures
• Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
• Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
• Optimization on the Euclidean unit sphere
• A tighter relaxation for the relative pose problem between cameras
• Computing the Hausdorff boundary measure of semialgebraic sets
• SONC optimization and exact nonnegativity certificates via second-order cone programming
• Sparse Polynomial Optimization
• Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
• A sublevel moment-SOS hierarchy for polynomial optimization
• Sparse noncommutative polynomial optimization
• Exploiting term sparsity in noncommutative polynomial optimization
• Sum-of-squares chordal decomposition of polynomial matrix inequalities
• Decomposed structured subsets for semidefinite and sum-of-squares optimization
• Exploiting sparsity in complex polynomial optimization
• Finding unstable periodic orbits: a hybrid approach with polynomial optimization
• A second order cone characterization for sums of nonnegative circuits
• A unified framework of SAGE and SONC polynomials and its duality theory

This page was built for software: TSSOS