摘要
在没有任何假设的条件下研究一般线性等式与不等式组和带广义界的线性等式的求解，利用最优化方法的思想建立了两个算法．方法仅需计算一个投影矩阵，迭代步长恒等于１．
In this paper, without any assumptions,methods for solving general linear equations and inequalities as well as linear equations holding generalized bounds are studied,two algorithms for them are presented with the help of optimization technique.The algorithms compute only one projection matrix,and their iteration steplength always equals one.The better global convergences of the two algorithms are proved.
出处
《广西大学学报（自然科学版）》
CAS
CSCD
1999年第2期108-111,共4页
Journal of Guangxi University（Natural Science Edition）
基金
国家自然科学基金
广西自然科学基金
关键词
线性系统
广义界
优化算法
线性规划
线性等式
linear systems
generalized bounds
optimization algorithms
global convergence
