Interior-point algorithms for sum-of-squares optimization of multidimensional trigonometric polynomials

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 3, Issue , 2007, Pages

  Roh, Tae ^a   Dumitrescu, Bogdan ^b   Vandenberghe, Lieven ^a  

^a Engineering IV   (United States)

^b TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Discrete transforms; Multidimensional digital filters; Optimization methods

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FOURIER TRANSFORMS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS;

DISCRETE TRANSFORMS; MULTIDIMENSIONAL DIGITAL FILTERS; OPTIMIZATION METHODS; SEMIDEFINITE PROGRAMMING;

ALGORITHMS;

EID: 34547537238     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2007.366827     Document Type: Conference Paper

References (13)

1. B. Alkire and L. Vandenberghe, "Convex optimization problems involving finite autocorrelation sequences," Mathematical Programming Series A, vol. 93, pp. 331 - 359, 2002.
2. B. Dumitrescu, "Trigonometric polynomials positive on frequency domains and applications to 2-D FIR filter design," IEEE Trans. Signal Proc., vol. 54, no. 11, pp. 4282-4292, Nov. 2006.
3. B. Dumitrescu, "Gram pair parameterization of multivariate sum-of-squares trigonometric polynomials," EUSIPCO, Florence, Italy, Sept. 2006.
4. J. B. Lasserre, "Global optimization with polynomials and the problem of moments," SIAM Journal on Optimization, vol. 11, no. 3, pp. 796-817, 2001.
5. P. A. Parrilo, "Semidefinite programming relaxations for semialgebraic problems," Mathematical Programming Series B, vol. 96, pp. 293-320, 2003.
6. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, "Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity," SIAM J. on Optimization, vol. 17, no. 1, pp. 218-242, 2006.
7. S. J. Benson, Y. Ye, and X. Zhang, "Solving large-scale sparse semidefinite programs for combinatorial optimization," SIAM J. on Optimization, vol. 10, no. 2, pp. 443-461, 2000.
8. J. Löfberg and P A. Parrilo, "From coefficients to samples: a new approach to SOS optimization," in Proceedings of the 43rd IEEE Conference on Decision and Control, 2004, pp. 3154-3159.
9. T. Roh and L. Vandenberghe, "Discrete transforms, semidefinite programming and sum-of-squares representations of nonnegative polynomials," SIAM J. on Optimization, vol. 16, no. 4, pp. 939-964, 2006.
10. A. Megretski, "Positivity of trigonometric polynomials," in Proceedings of the 42nd IEEE Conference on Decision and Control, 2003, pp. 3814-3817.
11. Y. Nesterov, "Squared functional systems and optimization problems," in High Performance Optimization Techniques, J. Frenk, C. Roos, T. Terlaky, and S. Zhang, Eds., pp. 405-440. Kluwer Academic Publishers, 2000.
12. J.F. Sturm, "Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones," Optimization Methods and Software, vol. 11-12, pp. 625-653, 1999, Version 1.1 available from http://sedumi.mcmaster.ca.
13. M. J. Todd, K. C. Toh, and R. H. Tütüncü, "On the Nesterov-Todd direction in semidefinite programming," SIAM J. on Optimization, vol. 8, no. 3, pp. 769-796, 1998.