A unified approach to the feasible direction methods for nonlinear programming with linear constraints
We introduce an algorithm with parameters for solving nonlinear programming problems with linear constraints. The algorithm is of the feasible direction method type. It is convergent under rather simple conditions. When these parameters are specified, we have many well-known algorithms as its special cases. Still more, many new algorithms can be derived from this general model.
scientific article; zbMATH DE number 3900521
scientific article