摘要
In this paper we discuss the degeneracy in nonlinear programming with linear constraints, and give a technique for dealing with degeneracy in a general model of reduced gradient algorithms. Under the assumption that the objective function is continuously differentiable, we prove that either the iterative sequence {xk} generated by the method terminates at a Kuhn-Tucker point after a finite number of iterations, or any cluster point of the sequence {xk} is a KuhnTucker point.
In this paper we discuss the degeneracy in nonlinear programming with linear constraints, and give a technique for dealing with degeneracy in a general model of reduced gradient algorithms. Under the assumption that the objective function is continuously differentiable, we prove that either the iterative sequence {xk} generated by the method terminates at a Kuhn-Tucker point after a finite number of iterations, or any cluster point of the sequence {xk} is a KuhnTucker point.
