Efficient algorithm for solving semi-infinite programming problems and their applications to nonuniform filter bank designs

Ho, Charlotte Yuk Fan, Ling, Bingo Wing-Kuen, Liu, Yan-Qun , Tam, Peter Kwong-Shun and Teo, Kok-Lay (2006) Efficient algorithm for solving semi-infinite programming problems and their applications to nonuniform filter bank designs. IEEE Transactions on Signal Processing, 54 (11). 4223 -4232. ISSN 1053-587X

Full content URL: http://dx.doi.org/10.1109/TSP.2006.880314

Documents
Efficient_Algorithm_for_Solving_Semi-infinite.pdf
[img]
[Download]
[img]
Preview
PDF
Efficient_Algorithm_for_Solving_Semi-infinite.pdf - Whole Document

351kB
Item Type:Article
Item Status:Live Archive

Abstract

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

Additional Information: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
Keywords:semi-infinite programming, dual parameterization, nonuniform filter banks
Subjects:H Engineering > H600 Electronic and Electrical Engineering
Divisions:College of Science > School of Engineering
ID Code:2699
Deposited On:22 Jun 2010 20:42

Repository Staff Only: item control page