Skip to Main Content
Sequential quadratic programming (SQP) algorithms are widely recognized to be among the most successful algorithms for nonconvex optimization. This paper attempts to develop an SQP-based method for frequency-response-masking (FRM) filters. We explain how the complementarity conditions in the SQP algorithm help reduce the amount of computation required to update the Lagrange multipliers in a significant manner. Simulation results are presented to demonstrate the algorithm's performance that compares favorably with several existing design methods.
Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on (Volume:5 )
Date of Conference: 23-26 May 2004