By Topic

Interior-Point Algorithms for Sum-Of-Squares Optimization of Multidimensional Trigonometric Polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Roh Tae ; Dept. of Electr. Eng., California Univ., Los Angeles, CA ; Dumitrescu, B. ; Vandenberghe, L.

A wide variety of optimization problems involving nonnegative polynomials or trigonometric polynomials can be formulated as convex optimization problems by expressing (or relaxing) the constraints using sum-of-squares representations. The semidefinite programming problems that result from this formulation are often difficult to solve due to the presence of large auxiliary matrix variables. In this paper we extend a recent technique for exploiting structure in semidefinite programs derived from sum-of-squares expressions to multivariate trigonometric polynomials. The technique is based on an equivalent formulation using discrete Fourier transforms and leads to a very substantial reduction in the computational complexity. Numerical results are presented and a comparison is made with general-purpose semidefinite programming algorithms. As an application, we consider a two-dimensional FIR filter design problem.

Published in:

Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on  (Volume:3 )

Date of Conference:

15-20 April 2007