Sequential algorithms in nonlinear programming

In this thesis, a class of methods for solving the following non-linear programming problem: minimize f(x) subject to x e S = {hi(x)=O,i=l,...ℓ;gj(x) ≥o, j=l,...,m} is investigated. The class of methods under investigation consists of the ones which reduce the computational process to a sequence of ... View More