We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Designing broad-band patch antennas using the sequential quadratic programming method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhifang Li ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Papalambros, P.Y. ; Volakis, J.L.

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

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:45 ,  Issue: 11 )