Convex optimization problems involving finite autocorrelation sequences

DOI10.1007/S10107-002-0334-XMaRDI QIDQ1396273zbMATH OpenOpenAlexFDO

Authors Brien Alkire, Lieven Vandenberghe

Publication date 30 June 2003

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-002-0334-x

zbMATH Keywords

interior-point methodsconvex optimization problems

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• Publication:4952741
• Applications of convex optimization in signal processing and digital communication
• Filter design: a finite dimensional convex optimization approach
• scientific article; zbMATH DE number 1186928
• Applications of semidefinite programming

Cited in

(13)

• LMI relaxations in robust control
• Semidefinite descriptions of cones defining spectral mask constraints
• Sampling method for semidefinite programmes with non-negative Popov function constraints
• Positivity and linear matrix inequalities
• Properties of the convex cone of vectors with autocorrelated components
• Primal-dual interior-point methods for domain-driven formulations
• Positive polynomial matrices and improved LMI robustness conditions.
• Sum-of-squares optimization without semidefinite programming
• Status determination by interior-point methods for convex optimization problems in domain-driven form
• Diagonalization of the symmetrized discrete \(i\)th right shift operator: an elementary proof
• A cutting plane method for solving KYP-SDPs
• Applications of convex optimization in signal processing and digital communication
• Semidefinite programming relaxations and algebraic optimization in control

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)