On the Convergence of Gradient Methods under Constraint

The mathematical programming problem discussed is the convergence of a certain popular type of gradient procedure for maximizing a function under inequality constraints. An example shows that convergence to a solution need not always occur, and a theorem shows that under certain circumstances the gradient method does converge.