Skip to main content
Article thumbnail
Location of Repository

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

By Charlotte Yuk Fan Ho, Bingo Wing-Kuen Ling, Yan-Qun Liu, Peter Kwong-Shun Tam and Kok-Lay Teo

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 algorith

Topics: H600 Electronic and Electrical Engineering
Publisher: IEEE
Year: 2006
DOI identifier: 10.1109/TSP.2006.880314
OAI identifier: oai:eprints.lincoln.ac.uk:2699

Suggested articles

Citations

  1. (2000). A dual parameterization method for convex semi-infinite programming,” doi
  2. (1987). A simple computational procedure for optimization problems with functional inequality constraints,” doi
  3. (1997). A simple design method for near-perfect-reconstruction nonuniform filter banks,” doi
  4. (1994). An algorithm for robust pole assignment via polynomial approach,” doi
  5. (2000). Antonio Cantoni and Zhuquan Zang, “Design of robust envelope-constrained filter with orthonormal bases,” doi
  6. (2005). Bingo Wing-Kuen Ling, Yan-Qun Liu, Peter Kwong-Shun Tam and Kok-Lay Teo, “Design of nonuniform near allpass complementary FIR filters via a semi-infinite programming technique,” doi
  7. (2005). Bingo Wing-Kuen Ling, Yan-Qun Liu, Peter Kwong-Shun Tam and Kok-Lay Teo, “Optimal design of nonuniform FIR transmultiplexer using semi-infinite programming,” doi
  8. (2000). Conditional central algorithms for worst case set-membership identification and filtering,” doi
  9. (1999). Design of complex FIR filters using semi-infinite quadratic optimization techniques,” doi
  10. (1998). Design of high-order Chebyshev FIR filters in the complex domain under magnitude constraints,” doi
  11. (1997). Envelope constrained filter with linear interpolator,” doi
  12. (2000). Frequency domain design for digital Laguerre networks,” doi
  13. (1999). Ingvar Claesson and Zhuquan Zang, “Optimum window design by semi-infinite quadratic programming,” doi
  14. (1994). Linear periodic systems and multirate filter design,” doi
  15. (1990). Lower bounds for parametric estimation with constraints,” doi
  16. (1988). Majorization: A computational complexity reduction technique in control system design,” doi
  17. (1984). Masao Fukushima and Yoshihiro Tanaka, “On the use of є-most-active constraints in an exact penalty function method for nonlinear optimization,” doi
  18. (2000). Matrix filter design using semi-infinite programming with application to DOA estimation,” doi
  19. (2002). Multiresolution analysis on bounded domains for the design of biorthogonal wavelet bases,” doi
  20. (1979). Nonlinear programming: theory and algorithm, doi
  21. (1988). Optimal rejection of persistent disturbances, robust stability, and mixed sensitivity minimization,” doi
  22. (2000). Rational suboptimal continuous-time controller design,” doi
  23. (1986). Sakae Fujimaki and Yo Ishizuka, “Constrained optimization methods in Hilbert spaces and their applications to optimal control problems with functional inequality constraints,” doi
  24. (1999). Semi-infinite linear programming: A unified approach to digital filter design with time- and frequency-domain specifications,” doi
  25. (1999). Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method,” doi
  26. (2000). The dual parameterization approach to optimal least square FIR filter design subject to maximum error constraints,” doi
  27. (1997). The role of linear semi-infinite programming in signal-adapted QMF bank design,” doi
  28. (1998). Theory and design of signal-adapted FIR paraunitary filter banks,” doi
  29. (1999). Zhuquan Zang and Antonio Cantoni, “A dual approach to continuous-time envelope-constrained filter design via orthonormal filters,” doi
  30. (2001). Zhuquan Zang and Ingvar Claesson, “A semi-infnite quadratic programming algorithm with applications to array pattern synthesis,” doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.