Abstract

Polynomial programming (PP) deals with a class of optimization problems where both the objective function and constraint functions are multivariable polynomials. PP covers several popular classes of convex optimization problems such as linear, convex quadratic, semidefinite, and second-order cone programming problems, it also includes a good many non-convex problems that are encountered in engineering analysis and design. This paper describes a preliminary attempt to apply a recently developed PP algorithm to the design of FIR digital filters with discrete coefficients. Computer simulations are presented to demonstrate the efficiency of the PP-based algorithm and its ability to provide globally or near-globally optimal designs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.