ABSTRACT
The Landweber and projected Landweber algorithms, the SMART and the EMML are all examples of sequential optimization methods. Perhaps the best known examples of sequential optimization are the sequential unconstrained minimization (SUM) methods [126]. Auxiliary-function algorithms, a broad subclass of sequential optimization methods, provide a unifying framework for these and many other iterative algorithms. In this chapter we consider examples of SUM methods, define the AF and SUMMA classes of algorithms, and present brief discussions of several topics to be considered in more detail in subsequent chapters.
