Technical Note—Theorems of Convergence for Improved Nonlinear Programming Algorithms

This note presents proofs of convergence of nonlinear programming algorithms under a weaker requirement than Zangwill's convergence theorems A and C. The objective is the removal of the closedness and the weakening of the adaption properties of the map-algorithm. In this approach two map-algorithms are used: one that provides the solution points, and one that provides convergence for the former.