期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A GENERAL TECHNIQUE FOR DEALING WITH DEGENERACY IN REDUCED GRADIENT METHODS FOR LINEARLY CONSTRAINED NONLINEAR PROGRAMMING 认领 引用
1
作者 韩继业 胡晓东 《Acta Mathematicae Applicatae Sinica》 1994年第1期90-101,共12页
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 t... 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. 展开更多
关键词 Degeneracy reduced gradient algorithms pivoting operation global convergence nonlinear programming
暂未订购 下载PDF
上一页 1 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈