Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials

Authors:
Tae Roh;Lieven Vandenberghe
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
2006

Citing 0
Cited 6

Brief paper: Linear matrix inequality tests for frequency domain inequalities with affine multipliers

Automatica (Journal of IFAC)
A Doppler robust max-min approach to radar code design

IEEE Transactions on Signal Processing
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification

SIAM Journal on Matrix Analysis and Applications
Brief paper: Enforcing stability constraints in set-membership identification of linear dynamic systems

Automatica (Journal of IFAC)
Symmetric self-Hilbertian filters via extended zero-pinning

Signal Processing
Optimization of radar phase-coded signals for multiple target detection

Signal Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a new semidefinite programming formulation of sum-of-squares representations of nonnegative polynomials, cosine polynomials, and trigonometric polynomials of one variable. The parametrization is based on discrete transforms (specifically, the discrete Fourier, cosine, and polynomial transforms) and has a simple structure that can be exploited by straightforward modifications of standard interior-point algorithms.