Abstract
The utility of numerical codes is greatly enhanced if they can be used in design, a situation that typically involves iterative optimization algorithms. An attractive way is to use gradient-based algorithms developed for solving nonlinear programming (NLP) problems. We examine the performance of a general sequential quadratic programming (SQP) optimization algorithm for designing patch antennas in conjunction with a finite-element boundary-integral code.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
