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 complexity of deciding convexity for quartic polynomials. We also prove that deciding strict convexity, strong convexity, quasiconvexity, and pseudoconvexity of polynomials of even degree four or higher is strongly NP-hard. By contrast, we show that quasiconvexity and pseudoconvexity of odd degree polynomials can be decided in polynomial time.

[1]  A. Seidenberg.  A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .

[2]  K. Arrow,et al.  QUASI-CONCAVE PROGRAMMING , 1961 .

[3]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[4]  O. Mangasarian.  PSEUDO-CONVEX FUNCTIONS , 1965 .

[5]  Jacques A. Ferland,et al.  On pseudo-convex functions of nonnegative variables , 1971, Math. Program..

[6]  J. Paquet,et al.  Second Order Conditions for Pseudo-Convex Functions , 1974 .

[7]  Man-Duen Choi.  Positive semidefinite biquadratic forms , 1975 .

[8]  D. McFadden,et al.  Production Economics: A Dual Approach to Theory and Applications (I): The Theory of Production , 1978 .

[9]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10]  J. Ferland.  Matrix-theoretic criteria for the quasiconvexity of twice continuously differentiable functions , 1981 .

[11]  Jacques A. Ferland,et al.  Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons , 1982, Math. Program..

[12]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[13]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[14]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[15]  Panos M. Pardalos,et al.  Open questions in complexity theory for numerical optimization , 1992, Mathematical programming.

[16]  P. Pardalos.  Complexity in numerical optimization , 1993 .

[17]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[18]  R. Tyrrell Rockafellar,et al.  Lagrange Multipliers and Optimality , 1993, SIAM Rev..

[19]  B. Guo.  On the difficulty of deciding the convexity of polynomials over simplexes , 1996, Int. J. Comput. Geom. Appl..

[20]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[21]  Pablo A. Parrilo,et al.  Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

[22]  P. Parrilo,et al.  Distinguishing separable and entangled states. , 2001, Physical review letters.

[23]  S. Basu,et al.  Algorithmic and Quantitative Real Algebraic Geometry , 2003 .

[24]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[25]  Leonid Gurvits.  Classical deterministic complexity of Edmonds' Problem and quantum entanglement , 2003, STOC '03.

[26]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[27]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[28]  Santosh S. Vempala,et al.  Testing Geometric Convexity , 2004, FSTTCS.

[29]  A. Magnani,et al.  Tractable fitting with convex polynomials via sum-of-squares , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[30]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[31]  The Complexity of Optimizing Over a Simplex, Hypercube or Sphere: A Short Survey , 2006 .

[32]  Yeung Sam Hung,et al.  Establishing Convexity of Polynomial Lyapunov Functions and Their Sublevel Sets , 2008, IEEE Transactions on Automatic Control.

[33]  J. Lasserre.  Representation of nonnegative convex polynomials , 2008, 0801.3754.

[34]  Etienne de Klerk,et al.  The complexity of optimizing over a simplex, hypercube or sphere: a short survey , 2008, Central Eur. J. Oper. Res..

[35]  Jean B. Lasserre,et al.  Convexity in SemiAlgebraic Geometry and Polynomial Optimization , 2008, SIAM J. Optim..

[36]  Amir Ali Ahmadi,et al.  A positive definite polynomial Hessian that does not factor , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[37]  Ruth F. Curtain,et al.  Proceedings of the 48th IEEE Conference on Decision and Control, CDC 2009, combined withe the 28th Chinese Control Conference, December 16-18, 2009, Shanghai, China , 2009, CDC.

[38]  Chen Ling,et al.  Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations , 2009, SIAM J. Optim..

[39]  J. William Helton,et al.  Semidefinite representation of convex sets , 2007, Math. Program..

[40]  Jean B. Lasserre.  Certificates of convexity for basic semi-algebraic sets , 2010, Appl. Math. Lett..

[41]  Rafael Castro-Linares,et al.  Trajectory tracking for non-holonomic cars: A linear approach to controlled leader-follower formation , 2010, 49th IEEE Conference on Decision and Control (CDC).

[42]  Amir Ali Ahmadi,et al.  On the equivalence of algebraic conditions for convexity and quasiconvexity of polynomials , 2010, 49th IEEE Conference on Decision and Control (CDC).

[43]  Jiawang Nie,et al.  Polynomial Matrix Inequality and Semidefinite Representation , 2009, Math. Oper. Res..

[44]  Amir Ali Ahmadi.  Algebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis , 2012, ArXiv.

[45]  Amir Ali Ahmadi,et al.  A convex polynomial that is not sos-convex , 2009, Math. Program..

[46]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .