Smaller SDP for SOS decomposition

DOI10.1007/s10898-015-0300-9zbMath1353.90103arXiv1407.2679OpenAlexW2048581684MaRDI QIDQ746820

Liyun Dai, Bican Xia

Publication date: 20 October 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Newton polytopesemi-definite programmingsum of squaresconvex cover polynomialsplit polynomial

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Uses Software

• CSDP
• Sostools
• YALMIP
• SOSOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Barrier certificates revisited
• A facial reduction algorithm for finding sparse SOS representations
• SINGULAR and applications
• Forms derived from the arithmetic-geometric inequality
• Extremal positive semidefinite forms
• Extremal psd forms with few terms
• On the long-step path-following method for semidefinite programming
• An algorithm for sums of squares of real polynomials
• Nondifferentiable optimization and polynomial problems
• Semidefinite programming relaxations for semialgebraic problems
• Sparsity in sums of squares of polynomials
• Uniform denominators in Hilbert's seventeenth problem
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
• There are significantly more nonnegative polynomials than sums of squares
• Global Optimization with Polynomials and the Problem of Moments
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Polynomial Equations and Convex Polytopes
• A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions
• Semidefinite optimization
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• CSDP, A C library for semidefinite programming
• Semidefinite Programming
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
• Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
• Optimization of Polynomials on Compact Semialgebraic Sets
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Smaller SDP for SOS decomposition