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

Mathematical Programming

Volumn 137, Issue 1-2, 2013, Pages 453-476

  Ahmadi, Amir Ali ^a   Olshevsky, Alex ^a   Parrilo, Pablo A ^a   Tsitsiklis, John N ^a  

^a Department of Electrical Engineering and Computer Science   (United States)

Author keywords

68Q25 Analysis of algorithms problem complexity; 90C60 Abstract computational complexity for mathematical programming problems; Mathematics Subject Classification (2000): 90C25 Convex programming

Indexed keywords

CLASSIFICATION (OF INFORMATION); CONVEX OPTIMIZATION; POLYNOMIAL APPROXIMATION;

MATHEMATICAL PROGRAMMING PROBLEM; MULTIVARIATE POLYNOMIAL; PROBLEM COMPLEXITY; QUARTIC POLYNOMIAL; STRICT CONVEXITY; STRONG CONVEXITIES; STRONGLY NP-HARD; SUBJECT CLASSIFICATION;

NP-HARD;

EID: 84878602784     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-011-0499-2     Document Type: Article

References (43)

1. Ahmadi, A.A.: Algebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis. PhD thesis, Massachusetts Institute of Technology, September (2011)
2. Ahmadi, A.A.; Parrilo, P.A.: A positive definite polynomial Hessian that does not factor. In: Proceedings of the 48th IEEE Conference on Decision and Control (2009)
3. Ahmadi, A.A.; Parrilo, P.A.: On the equivalence of algebraic conditions for convexity and quasiconvexity of polynomials. In: Proceedings of the 49th IEEE Conference on Decision and Control (2010)
4. Ahmadi, A.A.; Parrilo, P.A.: A convex polynomial that is not sos-convex. Math. Program. (2011) doi: 10.1007/s10107-011-0457-z
5. Arrow K.J.; Enthoven A.C.: Quasi-concave programming. Econometrica 29(4), 779-800 (1961)
6. Basu S.; Pollack R.; Roy M.F.: Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics, 2nd edn. Springer, Berlin (2006)
7. Bazaraa M.S.; Sherali H.D.; Shetty C.M.: Nonlinear Programming, 3rd edn. Wiley-Interscience, London (2006)
8. Blondel V.D.; Tsitsiklis J.N.: A survey of computational complexity results in systems and control. Automatica 36(9), 1249-1274 (2000)
9. Boyd S.; Vandenberghe L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
10. Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 460-469. ACM, New York (1988)
11. Chesi G.; Hung Y.S.: Establishing convexity of polynomial Lyapunov functions and their sublevel sets. IEEE Trans. Automat. Control 53(10), 2431-2436 (2008)
12. Choi M.D.: Positive semidefinite biquadratic forms. Linear Algebra Appl. 12, 95-100 (1975)
13. Cottle R.W.; Ferland J.A.: On pseudo-convex functions of nonnegative variables. Math. Program. 1(1), 95-101 (1971)
14. Crouzeix J.P.; Ferland J.A.: Criteria for quasiconvexity and pseudoconvexity: relationships and comparisons. Math. Program. 23(2), 193-205 (1982)
15. Crusius, C.A.R.: Automated analysis of convexity properties of nonlinear programs. PhD thesis, Department of Electrical Engineering, Stanford University (2002)
16. de Klerk E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. CEJOR Cent. Eur. J. Oper. Res. 16(2), 111-125 (2008)
17. Doherty, A.C.; Parrilo, P.A.; Spedalieri, F.M.: Distinguishing separable and entangled states. Phys. Rev. Lett. 88(18) (2002)
18. Ferland J.A.: Matrix-theoretic criteria for the quasiconvexity of twice continuously differentiable functions. Linear Algebra Appl. 38, 51-63 (1981)
19. Garey M.R.; Johnson D.S.: Computers and Intractability. W. H. Freeman and Co.; San Francisco (1979)
20. Grant, M.; Boyd, S.: CVX: Matlab software for disciplined convex programming, version 1.21. http://cvxr.com/cvx, May (2010)
21. Guo B.: On the difficulty of deciding the convexity of polynomials over simplexes. Int. J. Comput. Geometry Appl. 6(2), 227-229 (1996)
22. Gurvits, L.: Classical deterministic complexity of Edmonds' problem and quantum entanglement. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 10-19 (electronic). ACM, New York (2003)
23. Helton J.W.; Nie J.: Semidefinite representation of convex sets. Math. Program. 122(1(Ser. A)), 21-64 (2010)
24. Horn R.A.; Johnson C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1995)
25. Lasserre J.B.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19(4), 1995-2014 (2008)
26. Lasserre J.B.: Representation of nonnegative convex polynomials. Arch. Math. 91(2), 126-130 (2008)
27. Lasserre J.B.: Certificates of convexity for basic semi-algebraic sets. Appl. Math. Lett. 23(8), 912-916 (2010)
28. Lau L.J.: Testing and imposing monotonicity, convexity and quasiconvexity constraints. In: Fuss, M.A.; McFadden, D.L. (eds.) Production Economics: A Dual Approach to Theory and Applications, pp. 409-453. North-Holland Publishing Company, New York (1978)
29. Ling C.; Nie J.; Qi L.; Ye Y.: Biquadratic optimization over unit spheres and semidefinite programming relaxations. SIAM J. Optim. 20(3), 1286-1310 (2009)
30. Magnani, A.; Lall, S.; Boyd, S.: Tractable fitting with convex polynomials via sum of squares. In: Proceedings of the 44th IEEE Conference on Decision and Control (2005)
31. Mangasarian O.L.: Pseudo-convex functions. J. Soc. Ind. Appl. Math. Ser. A Control 3, 281-290 (1965)
32. Mangasarian, O.L.: Nonlinear programming. SIAM, 1994. First published in 1969 by the McGraw-Hill Book Company, New York
33. Mereau P.; Paquet J.G.: Second order conditions for pseudo-convex functions. SIAM J. Appl. Math. 27, 131-137 (1974)
34. Motzkin T.S.; Straus E.G.: Maxima for graphs and a new proof of a theorem of Turán. Can. J. Math. 17, 533-540 (1965)
35. Murty K.G.; Kabadi S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117-129 (1987)
36. Nie, J.: Polynomial matrix inequality and semidefinite representation. arXiv:0908.0364 (2009)
37. Pardalos, P.M. (ed.): Complexity in Numerical Optimization. World Scientific, River Edge (1993)
38. Pardalos P.M.; Vavasis S.A.: Open questions in complexity theory for numerical optimization. Math. Program. 57(2), 337-339 (1992)
39. Parrilo P.A.; Sturmfels B.: Minimizing polynomial functions. Algorithm. Quantitat. Real Algebr. Geometry DIMACS Ser. Discr. Math. Theoret. Comput. Sci. 60, 83-99 (2003)
40. Rademacher, L.; Vempala, S.: Testing geometric convexity. In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, volume 3328 of Lecture Notes in Comput. Sci.; pp. 469-480. Springer, Berlin (2004)
41. Rockafellar R.T.: Lagrange multipliers and optimality. SIAM Rev. 35, 183-238 (1993)
42. Seidenberg A.: A new decision method for elementary algebra. Ann. Math. (2) 60, 365-374 (1954)
43. Tarski A.: A Decision Method for Elementary Algebra and Geometry, 2nd edn. University of California Press, Berkeley (1951)