Equivalence in nonlinear programming

Abstract
The purpose of this work is to show the relation between the Kuhn‐Tucker and the gradient‐projection conditions for constrained maximization (minimization) problems. A similar relationship exists between Kuhn‐Tucker‐type conditions and gradient‐projection‐type conditions for certain constrained saddle‐point problems. This latter relationship may lead to a computational algorithm for these constrained saddle‐point problems.

This publication has 4 references indexed in Scilit: