By Topic

A new composite gradient algorithm to achieve global convergence

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

2 Author(s)
Simon, G. ; Dept. of Meas. Eng., Tech. Univ. Budapest, Hungary ; Peceli, G.

Insufficient-order system identification can result in a multimodal mean square error surface on which a gradient-type algorithm may converge to a local minimum. In this letter a new composite gradient algorithm (CGA) is presented which is due to achieve global convergence when the output error surface contains local minima. The proposed algorithm combines the useful properties of the output error (OE) and equation error (EE) adaptive filtering methods using a new dynamic error surface. The CGA provides a single convergence point for the gradient-search algorithm independently of the initial conditions. The “global convergence” conjecture is illustrated by simulation examples showing good global convergence properties even in such undermodeled cases when the Steiglitz-McBride algorithm fails

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:42 ,  Issue: 10 )