Sparsity in sums of squares of polynomials
- 29 December 2004
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 103 (1) , 45-62
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)Optimization Methods and Software, 2003
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 ProgramsSIAM Journal on Optimization, 2002
- Global Optimization with Polynomials and the Problem of MomentsSIAM Journal on Optimization, 2001
- Some concrete aspects of Hilbert’s 17th Problem2000
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3Optimization Methods and Software, 1999
- An algorithm for sums of squares of real polynomialsJournal of Pure and Applied Algebra, 1998
- Class of global minimum bounds of polynomial functionsCybernetics and Systems Analysis, 1988
- Extremal PSD forms with few termsDuke Mathematical Journal, 1978