Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials

From MaRDI portal
Publication:3648519

DOI10.1137/060668791zbMath1178.65048arXivmath/0606476OpenAlexW2085045434MaRDI QIDQ3648519

Jia-Wang Nie, James W. Demmel

Publication date: 27 November 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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




Related Items (19)

Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible setsPositive polynomials on fibre productsApproximate gcds of polynomials and sparse SOS relaxationsCertifying the global optimality of quartic minimization over the sphereA Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial OptimizationA Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization ProblemsSum-of-squares chordal decomposition of polynomial matrix inequalitiesOptimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxationAn Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial ProgrammingSum of squares methods for minimizing polynomial forms over spheres and hypersurfacesComparing SOS and SDP relaxations of sensor network localizationPositive polynomials on projective limits of real algebraic varietiesPerturbed sums-of-squares theorem for polynomial optimization and its applicationsExploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases ApproachNewton polytopes and relative entropy optimizationA sublevel moment-SOS hierarchy for polynomial optimizationUnivariate parameterization for global optimization of mixed-integer polynomial problemsA dynamic inequality generation scheme for polynomial programming


Uses Software



This page was built for publication: Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials