Efficient Algorithm for Solving Semi-Infinite Programming Problems and Their Applications to Nonuniform Filter Bank Designs

DOI10.1109/TSP.2006.880314MaRDI QIDQ4588016zbMATH OpenOpenAlexFDO

Authors Charlotte Yuk-Fan Ho, Bingo Wing-Kuen Ling, Yanqun Liu, P. K. S. Tam, Kok Lay Teo

Publication date 30 October 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2006.880314

Mathematics Subject Classification ID

Semidefinite programming (90C22) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(3)

• Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry
• Best linear near unbiased estimation for nonlinear signal models via semi-infinite programming approach
• scientific article; zbMATH DE number 7305731 (Why is no real title available?)

This page was built for publication: Efficient Algorithm for Solving Semi-Infinite Programming Problems and Their Applications to Nonuniform Filter Bank Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4588016)