Cart (Loading....) | Create Account
Close category search window
 

Conjugate gradient reuse algorithm using a variable step-size line search

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)
Birkett, A.N. ; Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada ; Goubran, R.A.

A new algorithm is presented which combines the fast conjugate gradient algorithm and the modified variable step-size algorithm with gradient reuse to provide a convergence/tracking performance trade-off. A simplified version of the proposed algorithm is also presented that reuses weight updates to avoid calculating gradients and conjugate directions at every sample n. This simplified algorithm only invokes the conjugate gradient update every Pth sample resulting in an overall complexity reduction by a factor of P as compared to the FCGA. Simulation results are also presented

Published in:

Circuits and Systems, 1997. ISCAS '97., Proceedings of 1997 IEEE International Symposium on  (Volume:4 )

Date of Conference:

9-12 Jun 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.