Convex optimization problems involving finite autocorrelation sequences

DOI10.1007/s10107-002-0334-xzbMath1023.90047OpenAlexW2082037093MaRDI QIDQ1396273

Lieven Vandenberghe, Brien Alkire

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)

Related Items (11)

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 ⋮ Positive polynomial matrices and improved LMI robustness conditions. ⋮ A cutting plane method for solving KYP-SDPs ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Primal-Dual Interior-Point Methods for Domain-Driven Formulations ⋮ 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 ⋮ Sampling method for semidefinite programmes with non-negative Popov function constraints

This page was built for publication: Convex optimization problems involving finite autocorrelation sequences