Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
From MaRDI portal
Publication:5470226
DOI10.1137/040612646zbMath1131.90039OpenAlexW2008797802MaRDI QIDQ5470226
No author found.
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/194af2451f70489680ab3203801da493ab9ecb1c
Related Items (10)
Sampling Algebraic Varieties for Sum of Squares Programs ⋮ Low-Rank Univariate Sum of Squares Has No Spurious Local Minima ⋮ Nuclear norm system identification with missing inputs and outputs ⋮ Enforcing stability constraints in set-membership identification of linear dynamic systems ⋮ Approximation of the joint spectral radius using sum of squares ⋮ Linear matrix inequality tests for frequency domain inequalities with affine multipliers ⋮ Frequency-hopping code design for Target detection via optimization theory ⋮ LMI relaxations in robust control ⋮ Semidefinite Representations of Gauge Functions for Structured Low-Rank Matrix Decomposition ⋮ Sampling method for semidefinite programmes with non-negative Popov function constraints
Uses Software
This page was built for publication: Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
