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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results