Discrete-Time EC Filtering Algorithms

  • Ba-Ngu Vo
  • Antonio Cantoni
  • Kok Lay Teo
Part of the Applied Optimization book series (APOP, volume 56)

Abstract

With the mathematical frame work established, we can now focus on the construction and characterization of algorithms for computing solutions. Convex programming is a broad class of problems and there is no general efficient method for finding solutions. Different classes of (convex programming) problems would require different algorithms depending on the specific nature imposed by engineering considerations.

Keywords

Line Search Finite Impulse Response Quadratic Programming Problem Finite Impulse Response Filter Steep Descent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Ba-Ngu Vo
    • 1
  • Antonio Cantoni
    • 2
  • Kok Lay Teo
    • 3
  1. 1.The University of MelbourneAustralia
  2. 2.The University of Western AustraliaAustralia
  3. 3.The Hong Kong Polytechnic UniversityHong Kong

Personalised recommendations