Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Philip Wolfe (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: