A convex optimization method to solve a filter design problem
From MaRDI portal
Publication:2252696
DOI10.1016/j.cam.2013.04.044zbMath1291.94023OpenAlexW2044943255MaRDI QIDQ2252696
Publication date: 23 July 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.04.044
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials, A convex optimization model for finding non-negative polynomials
Uses Software
Cites Work
- Graph Implementations for Nonsmooth Convex Programs
- Barrier Functions in Interior Point Methods
- Optimization Problems over Positive Pseudopolynomial Matrices
- Linear matrix inequality formulation of spectral mask constraints with applications to FIR filter design
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item