A positive definite polynomial Hessian that does not factor
The notion of sos-convexity has recently been proposed as a tractable sufficient condition for convexity of polynomials based on a sum of squares decomposition of the Hessian matrix. A multivariate polynomial p(x) = p(x[subscript 1],...,x[subscript n])is said to be sos-convex if its Hessian H(x) can...
Main Authors: | Ahmadi, Amir Ali (Contributor), Parrilo, Pablo A. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers,
2010-10-05T18:17:42Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
On the Complex and Real Hessian Polynomials
by: Emigdio Martínez-Ojeda, et al.
Published: (2010-01-01) -
Recursive Quadratic Programming with Positive Definite Hessian Matrix
by: Shih-Wei Chen, et al.
Published: (2000) -
On the equivalence of algebraic conditions for convexity and quasiconvexity of polynomials
by: Ahmadi, Amir Ali, et al.
Published: (2012) -
NP-hardness of deciding convexity of quartic polynomials and related problems
by: Ahmadi, Amir Ali, et al.
Published: (2012) -
sparseHessianFD: An R Package for Estimating Sparse Hessian Matrices
by: Michael Braun
Published: (2017-12-01)