NP-hardness of deciding convexity of quartic polynomials and related problems

NP-hardness of deciding convexity of quartic polynomials and related problems

We show that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the comple...

Full description

Bibliographic Details
Main Authors: Ahmadi, Amir Ali (Contributor), Olshevsky, Alexander (Contributor), Parrilo, Pablo A. (Contributor), Tsitsiklis, John N. (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: Springer-Verlag, 2012-10-01T19:11:27Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items