New convergence theorems for a class feasible directions algorithms

This paper presents two new theorems for establishing the convergence properties of multistep constrained optimization algorithms with antijamming features. The theorems extend earlier results of Polak and Klessig and are based on a transcription of multistep methods into one-step methods in a higher dimensional space. A comparison with Klessig´s original theorem is given.