A PTAS for the minimization of polynomials of fixed degree over the simplex

Theoretical Computer Science

Volumn 361, Issue 2-3, 2006, Pages 210-225

  de Klerk, Etienne ^a,b   Laurent, Monique ^c   Parrilo, Pablo A ^d  

^a TILBURG UNIVERSITY   (Netherlands)

^b UNIVERSITY OF WATERLOO   (Canada)

^c CWI   (Netherlands)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithm; Global optimization; Positive polynomial; Semidefinite programming; Sum of squares of polynomials

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHM; POSITIVE POLYNOMIAL; SEMIDEFINITE PROGRAMMING; SUM OF SQUARES OF POLYNOMIALS;

COMPUTATION THEORY;

EID: 33646746975     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.011     Document Type: Article

References (22)

1. Arora S., Lund C., Motwani R., Sudan M., and Szegedi M. Proof verification and intractability of approximations problems. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (1992), IEEE Computer Science Press, Los Alamitos, CA 14-23
2. Ausiello G., D'Atri A., and Protasi M. Structure preserving reductions among convex optimization problems. J. Comput. System Sci. 21 (1980) 136-153
3. Bellare M., and Rogaway P. The complexity of approximating a nonlinear program. Math. Programming 69 (1995) 429-441
4. Bomze I., and De Klerk E. Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. Global Optim. 24 2 (2002) 163-185
5. De Klerk E., Laurent M., and Parrilo P.A. On the equivalence of algebraic approaches to the minimization of forms on the simplex. In: Henrion D., and Garulli A. (Eds). Positive Polynomials in Control, Lecture Notes on Control and Information Sciences Vol. 312 (2005), Springer, Berlin 121-133
6. Faybusovich L. Global optimization of homogeneous polynomials on the simplex and on the sphere. In: Floudas C., and Pardalos P. (Eds). Frontiers in Global Optimization (2003), Kluwer Academic Publishers, Dordrecht
7. Motzkin T.S., and Straus E.G. Maxima for graphs and a new proof of a theorem of Túran. Canad. J. Math. 17 (1965) 533-540
8. Nemhauser G.L., Wolsey L.A., and Fisher M.L. An analysis of approximations for maximizing submodular set functions, I. Math. Programming 14 (1978) 265-294
9. Yu. Nesterov, Random walk in a simplex and quadratic optimization over convex polytopes, CORE Discussion Paper 2003/71, CORE-UCL, Louvain-La-Neuve, September 2003.
10. Nesterov Yu., Wolkowicz H., and Ye Y. Semidefinite programming relaxations of nonconvex quadratic optimization. In: Wolkowicz H., Saigal R., and Vandenberghe L. (Eds). Handbook of Semidefinite Programming (2000), Kluwer Academic Publishers, Norwell, MA 361-419
11. Nicolaides R.A. On a class of finite elements generated by Lagrange interpolation. SIAM J. Numer. Anal. 9 3 (1972) 435-445
12. Papadimitriou C.H., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall, New Jersey
13. P.A. Parrilo, Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization, Ph.D. Thesis, California Institute of Technology, May 2000.
14. Parrilo P.A. Semidefinite programming relaxations for semialgebraic problems. Math. Programming Ser. B 96 (2003) 293-320
15. Pólya G. Collected Papers Vol. 2 (1974), MIT Press, Cambridge, MA, London pp. 309-313
16. Powers V., and Reznick B. A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. J. Pure Appl. Algebra 164 (2001) 221-229
17. Powers V., and Wörmann T. An algorithm for sums of squares of real polynomials. J. Pure Appl. Algebra 127 (1998) 99-104
18. Reznick B. Sums of even powers of real linear forms. Mem. Amer. Math. Soc. 463 (1992)
19. Reznick B. Uniform denominators in Hilbert's seventeenth problem. Math. Z. 220 (1995) 75-97
20. Schmüdgen K. The K-moment problem for compact semi-algebraic sets. Math. Ann. 289 (1991) 203-206
21. Vavasis S. Approximation algorithms for concave quadratic programming. In: Floudas C.A., and Pardalos P. (Eds). Recent Advances in Global Optimization (1992), Princeton University Press, Princeton, NJ 3-18
22. L.F. Zuluaga, J.C. Vera, J.F. Peña, LMI approximations for cones of positive semidefinite forms, SIAM J. Optim. 16 (2006) 1076-1091.