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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results