×

zbMATH — the first resource for mathematics

On computer-algebra procedures for linear least squares problems with linear inequality constraints. (Russian, English) Zbl 1094.68126
Zh. Vychisl. Mat. Mat. Fiz. 44, No. 5, 771-776 (2004); translation in Comput. Math. Math. Phys. 44, No. 5, 727-731 (2004).
The computer-algebraic procedures developed by the authors for the solution of a linear least squares problem with constraints as linear inequalities are described. A new way for reducing this problem to the LDP (Least Distance Programming – calculation of the smallest distance) problem is specified. The singularities of this solution are considered. Computing results are presented.

MSC:
68W30 Symbolic computation and algebraic computation
15A39 Linear inequalities of matrices
90C20 Quadratic programming
PDF BibTeX XML Cite