摘要
线性规划的无约束凸规划算法的计算实现汪定伟（东北大学自动控制系）ＩＭＰＬＥＭＥＮＴＡＴＩＯＮＯＦＴＨＥＵＮＣＯＮＳＴＲＡＩＮＥＤＣＯＮＶＥＸＰＲＯＱＲＡＭＭＩＮＧＡＰＰＲＯＡＣＨＦＯＲＬＩＮＥＡＲＰＲＯＧＲＡＭＭＩＮＧ￥ＷａｎｇＤｉｎｇｗｅｉ（Ｎｏｒ...
Abstract A hybrid computational algorithm combining the steepest descent with conjugate direction is. designed to implement the newly developed unconstrained convex programming approach to solve linear programming problems. The preliminary results show that the algorithm has good potential in solving large scale LP problems.The solution entropy embedded in the approach can reveal the procedure of solving LP in terms of information theory
出处
《数值计算与计算机应用》
CSCD
北大核心
1995年第4期255-261,共7页
Journal on Numerical Methods and Computer Applications
