Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2008, Pages 155-163

  Kaltofen, Erich ^a   Li, Bin ^b   Yang, Zhengfeng ^a   Zhi, Lihong ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b Key Laboratory of Network   (China)

Author keywords

Approximate factorization; Hybrid method; Semidefinite programming; Sum of squares; Validated output

Indexed keywords

CONTROL THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SEMICONDUCTOR SWITCHES; TURBULENT FLOW;

APPROXIMATE FACTORIZATION; HYBRID METHOD; SEMIDEFINITE PROGRAMMING; SUM-OF-SQUARES; VALIDATED OUTPUT;

FACTORIZATION;

EID: 57449108073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390768.1390792     Document Type: Conference Paper

References (47)

1. BOYD, D., KALTOFEN, E., AND ZHI, L. Integer polynomials with large single factor coefficient bounds. In preparation, 2008.
2. CHÉGZE, G., AND YAKOUBSOIIN, J.-C. Distance computation to the resultant variety. Nov. 2007. Talk at the Journées 2007 da l'ANR GECKO, URL: http://www-sop.inria.fr/galaad/conf/ 07gecko/Yakoubshon.J.C.pdf.
3. COLLINS, G. E. Single-factor coefficient bounds. J. Symbolic Comput. 38, 6 (2004), 1507 1521.
4. DAHAN, X., AND SCHOST, é. Sharp estimates for triangular sets. In Gutierrez [9], pp. 103-110.
5. r3. In SoCG '07: Proceedings of the 23-rd Annual Symposium on Computational Geometry (2007), ACM, New York, USA, pp. 255-264.
6. GAO, S., KALTOFEN, E., MAY, J. P., YANG, Z., AND ZHI, L. Approximate factorization of multivariate polynomials via differential equations. In Gutierrez [9], pp. 167-174.
7. GOLUB, G. H., AND VAN LOAN, C. F. Matrix Computations, third ed. Johns Hopkins University Press, Baltimore, Maryland, 1996.
8. GREGORY, B., AND KALTOFEN, E. Analysis of the binary complexity of asymptotically fast algorithms for linear system solving. SIGSAM Bulletin 22, 2 (Apr. 1988), 41-49.
9. GUTIERREZ, J., Ed. ISSAC 2004 Proc. 2004 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2004), ACM Press.
10. HILLAR, C. Sums of polynomial squares over totally real fields are rational sums of squares. Proc. American Math. Society (2008). To appear. URL: http://www.math.tamu.edu/̃̃chillar/files/totallyrealsos. pdf.
11. HITZ, M. A., AND KALTOFEN, E. Efficient algorithms for computing the nearest polynomial with constrained roots. In Proc. 1998 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'98) (New York, N. Y., 1998), O. Gloor, Ed., ACM Press, pp. 236-243.
12. JIBETEAN, D., AND DE KLERK, E. Global optimization of rational functions: a semidefinite programming approach. Math. Program. 106, 1 (2006), 93-109.
13. KALTOFEN, E., LI, B., SIVARAMAKRISHNAN, K., YANG, Z., AND ZHI, L. Lower bounds for approximate factorizations via semidefinite programming (extended abstract). In Verschelde and Watt [42], pp. 203-204.
14. KALTOFEN, E., AND MAY, J. On approximate irreducibility of polynomials in several variables. In ISSAC 2003 Proc. 2003 Internal. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2003), J. R. Sendra, Ed., ACM Press, pp. 161-168.
15. KALTOFEN, E., MAY, J., YANG, Z., AND ZHI, L. Approximate factorization of multivariate polynomials using singular value decomposition. J. Symbolic Comput. 43, 5 (2008), 359-376.
16. KALTOFEN, E., YANG, Z., AND ZHI, L. Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In ISSAC MMVI Proc. 2006 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2006), J.-G. Dumas, Ed., ACM Press, pp. 169-176.
17. KALTOFEN, E., YANG, Z., AND ZHI, L. On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. In Verschelde and Watt [42], pp. 11-17.
18. KARMARKAR, N. K., AND LAKSHMAN Y. X. On approximate GCDs of univariate polynomials. J. Symbolic Corn-put. 26, 6 (1998), 653-666. Special issue on Symbolic Numeric Algebra for Polynomials S. M. Watt and H. J. Stetter, editors.
19. LASSERRE, J. B. Global optimization with polynomials and the problem of moments. SIAM J. on Optimization 11, 3 (2000), 796-817.
20. LASSERRE, J. B. Global SDP-relaxations in polynomial optimization with sparsity. SIAM J. on Optimization 17, 3 (2006), 822-843.
21. LI, B., LIU, Z., AND ZHI, L. Structured condition numbers of Sylvester matrices (extended abstract), Dec. 2007. Presented at MACIS 2007, URL: http://www-spiral.lip6.fr/MACIS2007/Papers/ submission-17.pdf.
22. LI, B., NIE, J., AND ZHI, L. Approximate GCDs of polynomials and SOS relaxation. In Verschelde and Watt [42], pp. 205-206.
23. LI, B., NIE, J., AND ZHI, L. Approximate GCDs of polynomials and sparse SOS relaxations. Manuscript, 16 pages. Submitted, 2007.
24. LÖFBERG, J. YALMIP : A toolbox for modeling and optimization in MATLAB. In Proc. IEEE CCA/ISIC/CACSD Conf. (Taipei, Taiwan, 2004). URL: http://control.ec.cthz.ch/̃joloef/yalmip.php.
25. MIGNOTTE, M. Some useful bounds. In Computer Algebra, B. Buchberger, G. Collins, and R. Loos, Eds., 2 ed. Springer Verlag, Heidelberg, Germany, 1982, pp. 259-263.
26. NAGASAKA, K. Towards certified irreducibility testing of bivariate approximate polynomials. In Proc. 2002 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'02) (New York, N. Y., 2002), T. Mora, Ed., ACM Press, pp. 192-199.
27. NIE, J., AND DEMMEL, J. Sparse SOS relaxations for minimization functions that are summation of small polynomials, 2007.
28. NIE, J., DEMMEL, J., AND GU, M. Global minimization of rational functions and the nearest GCDs. Ar Xiv Mathematics e-prints (Jan. 2006). URL: http://arxiv.org/pdf/math/0601110.
29. NIE, J., RANESTAD, K., AND STURMFELS, B. The algebraic degree of semidefinite programming, 2006. URL: http://www.citebase.org/abstract?id=oai:arXiv.org:math/0611562.
30. NIE, J., AND SCHWEIGHOFER, M. On the complexity of Putinar's Positivstellensatz. J. Complexity 23 (2007), 135-70.
31. PARRILO, P. A. Structured, semidefinite programs and, semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, May 2000. URL: http://www.cds.caltcch.edu/ ̃pablo/.
32. PARRILO, P. A. Exploiting algebraic structure in sum of squares programs. Lecture Notes in Control and Information Sciences 312 (2005), 181-194.
33. PARRILO, P. A., AND STURMFELS, B. Minimizing polynomial functions. DIMACS scries in discrete mathematics and theoretical computer 60 (2003), 83. URL: http://www.citcbasc.org/abstract?id=oai:arXiv. org:math/0103170.
34. PEYRL, H., AND PARRILO, P. A. A Macaulay 2 package for computing sum of squares decompositions of polynomials with rational coefficients. In Verschelde and Watt [42], pp. 207 208.
35. PRAJNA, S., PAPACHRISTODOULOU, A., AND PARRILO, P. A. SOSTOOLS: Sum of squares optimization toolbox for MATLAB. URL: http://www.cds.caltech.edu/sostools.
36. REZNICK, B. Extremal PSD forms with few terms. Duke Mathematical Journal 45, 2 (1978), 363-374.
37. RUMP, S. M. Structured perturbations part I: Normwise distances. SIAM J. Matrix Anal. Applic. 25, 1 (2003), 1-30.
38. RUMP, S. M. Global optimization: a model problem, 2006. URL: http://www.ti3.tu-harburg.de/rump/Research/ModelProblem.pdf.
39. RUMP, S. M., AND SEKIGAWA, H. The ratio between the Toeplitz and the unstructured condition number, 2006. To appear. URL: http://www.ti3.tu-harburg.de/paper/rump/RuSe06.pdf.
40. SAFEY EL DIN, M. Computing the global optimum of a inultivariate polynomial over the reals. In ISSAC 2008 Proc. 2008 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2008), D. Jeffrey, Ed., ACM Press. These Proceedings.
41. STURM, J. F. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software 11/12 (1999), 625-653.
42. VERSCHELDE, J., AND WATT, S. M., Eds. SNC'07 Proc. 2007 Internal. Workshop on Symbolic-Numeric Comput. (New York, N. Y., 2007), ACM Press.
43. VILLARD, G. Certification of the QR factor R and of lattice basis reducedness. In ISSAC 2007 Proc. 2007 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2007), C. W. Brown, Ed., ACM Press, pp. 361-368.
44. WAKI, H., KIM, S., KOJIMA, M., AND MURAMATSU, M. Sums of squares and scmidchnitc programming relaxations for polynomial optimization problems with structured sparsity. SIAM Journal on Optimization 17 (2006), 218-242.
45. ZHANG, T., XIAO, R., AND XIA, B. Real soultion isolation based on interval Krawczyk operator. In Proc. of the Seventh, Asian Symposium on Computer Mathematics (Seoul, South Korea, 2005), S. Pae and H. Park, Eds., Korea Institute for Advanced Study, pp. 235-237. Extended abstract.
46. ZHI, L. Numerical optimization in hybrid symbolic-numeric computation. In Verschelde and Watt [42], pp. 33-35.
47. ZHOU, W., AND JEFFREY, D. J. Fraction-free matrix factors: new forms for LU and QR factors. In Frontiers of Computer Science in China (2008). To appear. URL http://www.apmaths.uwo.ca/ ̃djcffrey/Offprints/FFLUQR.pdf.