Iterative solution of inconsistent systems of linear inequalities
暂无分享,去创建一个
In 1980 S.P. Han proposed a finitely terminating (in exact arithmetic) algorithm for solving an inconsistent system of linear inequalities in a least squares sense. This algorithm uses a singular value decomposition of a submatrix of the problem matrix on each iteration, making it impractical for all but only smaller problems. In this paper we show that a modification of Han's algorithm allows us to introduce an iterative approximation to the singular value decomposition solution. (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)
[1] S P Han. Least-Squares Solution of Linear Inequalities. , 1980 .
[2] C. Popa,et al. On Kaczmarz’s projection iteration as a direct solver for linear least squares problems , 2012 .
[3] C. Popa. Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems , 1998 .
[4] Randall Bramley,et al. Solving Linear Inequalities in a Least Squares Sense , 1996, SIAM J. Sci. Comput..