On the equivalence of algebraic conditions for convexity and quasiconvexity of polynomials
This paper is concerned with algebraic relaxations, based on the concept of sum of squares decomposition, that give sufficient conditions for convexity of polynomials and can be checked efficiently with semidefinite programming. We propose three natural sum of squares relaxations for polynomial conv...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2012-10-19T15:19:55Z.
|
| Subjects: | |
| Online Access: | Get fulltext |