Skip to Main Content
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 ,  and Fujisawa and Yasuda . 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.