ABSTRACT

Barrier-function and penalty-function methods are the best known examples of sequential optimization. In their usual formulations neither fits into the AF class of algorithms. However, barrier-function algorithms can be reformulated to fit into the SUMMA class, while penalty-function methods can be converted to barrier-function methods by switching the roles of the objective and penalty functions.