IBM Journal of Research and Development · 1972 · 58 citations · 1 references
Natural SciencesComputer ScienceMathematicsAlgorithmsOptimizationConstrained OptimizationConvex OptimizationGradient-based OptimizationMathematical ProgrammingNonlinear ProgrammingOptimization TheoryConstraint OptimizationConstraint-based OptimizationConstraintsGradient DescentGradient Method OptimizationGradient ProgrammingMathematical Programming ModelsOptimization Under Constraints
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.
1