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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Vo, BN., Cantoni, A., Teo, K.L. (2001). Discrete-Time EC Filtering Algorithms. In: Filter Design With Time Domain Mask Constraints: Theory and Applications. Applied Optimization, vol 56. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3409-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3409-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4858-8
Online ISBN: 978-1-4757-3409-6
eBook Packages: Springer Book Archive