Convex optimization problems involving finite autocorrelation sequences
From MaRDI portal
Recommendations
Cited in
(14)- Applications of convex optimization in signal processing and digital communication
- Positive polynomial matrices and improved LMI robustness conditions.
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- A cutting plane method for solving KYP-SDPs
- LMI relaxations in robust control
- Positivity and linear matrix inequalities
- Semidefinite programming relaxations and algebraic optimization in control
- Semidefinite descriptions of cones defining spectral mask constraints
- Properties of the convex cone of vectors with autocorrelated components
- Sum-of-squares optimization without semidefinite programming
- Primal-dual interior-point methods for domain-driven formulations
- Sampling method for semidefinite programmes with non-negative Popov function constraints
- First-order methods for nonnegative trigonometric matrix polynomials
- Diagonalization of the symmetrized discrete \(i\)th right shift operator: an elementary proof
This page was built for publication: Convex optimization problems involving finite autocorrelation sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396273)