By Topic

Some efficient algorithms for a class of abstract optimization problems arising in optimal control

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
$33 $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)
R. Barr ; Michigan State University, East Lansing, MI, USA ; E. Gilbert

Three abstract optimization problems are presented along with doubly iterative algorithms for their numerical solution. These algorithms are generalizations of particular algorithms described by Barr and Gilbert [19], [21] and Fujisawa and Yasuda [22]. The supporting theory is fully developed along with proofs of convergence. Practical aspects of computations are considered and procedures which insure rapid convergence are discussed. Two applications to discrete-time optimal control problems are described.

Published in:

IEEE Transactions on Automatic Control  (Volume:14 ,  Issue: 6 )