Efficient Algorithm for Solving Semi-Infinite Programming Problems and Their Applications to Nonuniform Filter Bank Designs
Efficient Algorithm for Solving Semi-Infinite Programming Problems and Their Applications to Nonuniform Filter Bank Designs
复制标题
DOI：
10.1109/tsp.2006.880314
复制
发表时间：
2006-11
影响因子：
5.4
通讯作者：
C. Y. Ho;B. Ling;Yanqun Liu;P. Tam;K. Teo
中科院分区：
文献类型：
--
作者：
C. Y. Ho;B. Ling;Yanqun Liu;P. Tam;K. Teo
本文提出了一种求解半无限规划问题的有效算法。索引集是通过在一组细化的网格点中仅添加一个最受侵犯的点来构造的。将该算法应用于求解非均匀对称/反对称线性相位有限脉冲响应（FIR）滤波器组的最优设计问题，得到全局最优解所需的时间比以前提出的算法大大减少
An efficient algorithm for solving semi-infinite programming problems is proposed in this paper. The index set is constructed by adding only one of the most violated points in a refined set of grid points. By applying this algorithm for solving the optimum nonuniform symmetric/antisymmetric linear phase finite-impulse-response (FIR) filter bank design problems, the time required to obtain a globally optimal solution is much reduced compared with that of the previous proposed algorithm